Cod sursa(job #305421)
Utilizator | Data | 17 aprilie 2009 11:23:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream.h>
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[2000001];
long i,k,n,a;
int main() {
fin>>n;
for (i=2;i<=n;++i)
if (!v[i])
{
for (k=i;i*k<=n;++k)
if (!v[i*k])
v[i*k]=2;
a++;
}
fout<<a;
return 0;
}