Cod sursa(job #900675)
Utilizator | Data | 28 februarie 2013 21:11:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i, j, n, nr;
bool p[1000];
int main ()
{ f>>n;
for (i = 2; i <= n; ++i) if (p[i] == 0) { nr++;
g<<i<<" ";
for (j = i + i; j <= n; j += i) p[j] = 1;
}
g<<'\n'<<nr;
f.close ();
g.close ();
return 0;
}