Cod sursa(job #419925)
Utilizator | Data | 18 martie 2010 10:38:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
int n,i,j,cnt;
char prim[2000005];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i = 2;i <= n;++i) prim[i] = 1;
for(i = 2;i <= n;++i)
{
if(prim[i])
{
++cnt;
for(j = i + i;j <= n;j+=i)
prim[j] = 0;
}
}
printf("%d\n",cnt);
return 0;
fclose(stdin);fclose(stdout);
}