Cod sursa(job #278844)
Utilizator | Data | 12 martie 2009 15:54:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream.h>
ifstream fin("prim.in");
ofstream fout("prim.out");
long v[2000000],i,k=1,n,j;
int main() {
fin>>k;
for (i=2;i<=2000000;i++)
if (v[i]==0)
{ k++;
for (j=2*i;j<=1350000;j+=i)
if (v[j]==0)
v[j]=1;
}
fout<<k;
return 0;
}