Cod sursa(job #234623)
Utilizator | Data | 21 decembrie 2008 13:11:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
FILE *f,*g;
long p[2000001];
int main()
{
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
long n,i,j,k=0;
fscanf(f,"%ld",&n);
fclose(f);
for (i=1;i<=n;i++)
p[i]=1;
i=2;
while(i<=n)
{
if(p[i]==1){
k++;
for(j=i+i;j<=n;j=j+i)
p[j]=0;
}
i++;
}
fprintf(g,"%ld",k);
fclose(g);
return 0;
}