Cod sursa(job #1121948)
Utilizator | Data | 25 februarie 2014 14:58:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <cstdio>
#include <cmath>
#define lld long long unsigned
using namespace std;
lld n,i,nrprim,j;
int a[2000005];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%lld",&n);
a[2]=1;
nrprim=1;
for(i=3;i<=sqrt(n);i++)
{
if(a[i]==0)
{
nrprim++;
a[i]=1;
}
for(j=i*i;j<=n;j+=2*i)
a[j]=1;
}
for(;i<=n;i++)
if(!a[i]&&i%2)
nrprim++;
printf("%lld",nrprim);
return 0;
}