Cod sursa(job #163271)
Utilizator | Data | 21 martie 2008 21:06:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
/* ciurul lui eratosthene */
#include<stdio.h>
#include<math.h>
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
long n,viz[2000001];
int main()
{
fscanf(f,"%ld",&n);
long i,k;
k=0;
for(i=2;i<=n;i++)
{if(!viz[i])
++k;
for(long j=i+i;j<=n;j+=i)
viz[j]=1;
}
fprintf(g,"%ld",k);
fcloseall();
return 0;
}