Cod sursa(job #181713)
Utilizator | Data | 18 aprilie 2008 20:24:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
FILE *f,*g;
char a[2000005];
long n,contor,i,j;
int main()
{
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%ld\n",&n);
for(i=2;i<=n/2;i++)
if(a[i]!=1)
for(j=2*i;j<=n;j+=i)
a[j]=1;
for(i=2;i<=n;i++)
if(a[i]==0)
contor++;
fprintf(g,"%ld\n",contor);
fclose(f); fclose(g);
return 0;
}