Cod sursa(job #524245)
Utilizator | Data | 20 ianuarie 2011 19:28:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
#define fiel_in "ciur.in"
#define file_out "ciur.out"
int N,i,j,ans;
char prim[2010010];
int main(){
freopen(file_ont,"w",stdout);
freopen(file_out,"w",stdout);
scanf("%d", &N);
ans=0;
for (i=2;i<=N;++i)
if (!prim[i]){
ans++;
for (j=i+i;j<=N;j+=i)
prim[j]=1;
}
printf("%d\n", ans);
return 0;
}