Cod sursa(job #577299)
Utilizator | Data | 10 aprilie 2011 00:06:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
FILE *f, *g;
bool a[1000000];
int main()
{
f=fopen("ciur.in", "r");
g=fopen("ciur.out", "w");
int n, nr=0, i=2, j;
fscanf(f, "%d", &n);
for(i=2; i<=n; ++i) { if(!a[i]) { ++nr;
for(j=i; j<=n; j+=i) a[j]=1;
}
if(i==n) break;
}
fprintf(g, "%d", nr);
fclose(f);
fclose(g);
return 0;
}