Cod sursa(job #309308)
Utilizator | Data | 30 aprilie 2009 00:04:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream.h>
int n,nr;
char prim[2000005];
int main()
{
int i,j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (i=2;i<=n;i++)
prim[i]=1;
for (i=2;i<=N;i++)
if(prim[i])
{
++nr;
for (j=2*i;j<=n;j+=i)
prim[j]=0;
}
g<<nr;
return 0;
}