Cod sursa(job #402188)
Utilizator | Data | 23 februarie 2010 16:43:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
long i,j,n,qq;
const long N = 1<<21;//1 shiftat la stanga cu 21 de pozitii = 2 la 21
bool c[N];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);
for(i=2;i*i<=n;++i)
if(!c[j])
{
for(j=i*i;j<=n;j+=i)
c[j]=true;
}
for(i=1;i<=n;i++)
if(!c[i])
qq++;
printf("%ld",qq-1);
return 0;
}