Cod sursa(job #431509)
Utilizator | Data | 1 aprilie 2010 08:34:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
FILE *in,*out;
int n,cont,i,j;
bool prim[2000005];
int main()
{
in=fopen("ciur.in","rt");
out=fopen("ciur.out","wt");
fscanf(in,"%d",&n);
for(i=1;i<=n;i++)
prim[i]=true;
for(i=2;i<=n;i++)
{
if(prim[i])
{
++cont;
for(j=i+i;j<=n;j+=i)
prim[j]=false;
}
}
fprintf(out,"%d",cont);
return 0;
}