Cod sursa(job #645624)
Utilizator | Data | 9 decembrie 2011 23:53:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
#define file_in "ciur.in"
#define file_out "ciur.out"
#define nmax 2010001
char p[nmax];
int N,i,ans,j;
int main(){
freopen(file_in,"r",stdin);
freopen(file_out,"w",stdout);
scanf("%d", &N);
ans=0;
for (i=2;i<=N;++i)
if (!p[i]){
ans++;
for (j=i+i;j<=N;j+=i)
p[j]=1;
}
printf("%d\n", ans);
return 0;
}