Cod sursa(job #198860)
| Utilizator | Data | 15 iulie 2008 14:47:46 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
FILE *f,*g;
int n, nr;
char prim[20000005];
int main()
{
int i, j;
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d", &n);
for (i = 2; i <= n; ++i)
prim[i] = 1;
for (i = 2; i <= n; ++i)
if (prim[i])
{
++nr;
for (j = i+i; j <= n; j += i)
prim[j] = 0;
}
fprintf(g,"%d\n", nr);
fcloseall();
return 0;
}
