Cod sursa(job #165734)
Utilizator | Data | 26 martie 2008 18:29:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
int n,i,j;
char prim[2000004];
int main()
{FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
fclose(f);
int max=0;
for(i=2;i<=n;i++)
prim[i]=1;
for (i = 2; i <= n; i++)
if (prim[i])
{
max++;
for (j = i*i; j <= n; j += i)
prim[j] = 0;
}
fprintf(g,"%d ",max);
fclose(g);
return 0;
}