Cod sursa(job #577291)
Utilizator | Data | 9 aprilie 2011 23:40:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<cstdio>
#define maxn 1000001
FILE *f, *g;
long long a[maxn], n, i, j, nr;
int main()
{
f=fopen("ciur.in", "r");
g=fopen("ciur.out", "w");
fscanf(f, "%d", &n);
for(i=2; i<=n; ++i) a[i]=i;
for(i=2; i<=n; ++i) if(a[i]) { ++nr;
for(j=i; j<=n; j+=i) a[j]=0;
}
fprintf(g, "%d", nr);
fclose(f);
fclose(g);
return 0;
}