Cod sursa(job #333799)
Utilizator | Data | 23 iulie 2009 22:04:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
int main()
{
int n,i,j,nr=0,prime[2000000];
FILE *f=fopen("ciur.in","r");
fscanf(f,"%i",&n);
fclose(f);
for(i=0;i<=2000000;i++)
prime[i]=1;
for(i=2;i<=n;i++)
{
if(prime[i]==1)
{
for(j=i+i;j<=n;j+=i)
prime[j]=0;
nr++;
}
}
f=fopen("ciur.out","w");
fprintf(f,"%i\n",nr);
fclose(f);
return 0;
}