Cod sursa(job #2575825)
Utilizator | Data | 6 martie 2020 15:38:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
#define l 2000005
ifstream in("ciur.in");
ofstream out("ciur.out");
int v[l],c,n,i,j;
void ciur()
{
v[0]=1;
v[1]=1;
for (i=2; i<=sqrt(n); i++)
if (v[i]==0)
for (j=2; j<=n/i; j++)
v[i*j]=1;
}
void numara()
{
for (i=0;i<n;i++)
if (v[i]==0)
c++;
}
int main()
{
in>>n;
ciur();
numara();
out<<c;
}