Cod sursa(job #234589)
Utilizator | Data | 21 decembrie 2008 11:30:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
#include <math.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);
i=2;
while(i<=n)
{
if(p[i]==0){
k++;
for(j=i+i;j<=n;j=j+i) p[j]=1;
}
i++;
}
fprintf(g,"%ld",k);
fclose(f);
fclose(g);
return 0;
}