Cod sursa(job #239936)
Utilizator | Data | 6 ianuarie 2009 12:33:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int N,ciur[2000005],nr,i,j;
int main()
{
f>>N;
for (i = 2; i <= N; ++i)
ciur[i]=1;
for (i = 2; i <= N; ++i)
if(ciur[i])
{
++nr;
for (j = i+i; j <= N; j+=i)
ciur[j]=0;
}
g<<nr<<"\n";
f.close();
g.close();
return 0;
}