Cod sursa(job #232960)
| Utilizator | Data | 16 decembrie 2008 15:47:47 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
bool ok[3000000];
int i, j, n;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin >> n;
for (i = 0; i < n; i++)
ok[i] = true;
for (i = 2; i*i <= n; i++)
if (ok[i])
{
j = 2;
while (i*j <= n)
{
ok[i*j] = false;
j++;
}
}
for (i = 2; i <= n; i++)
if (ok[i])
fout << i << ' ';
fin.close();
fout.close();
return 0;
system ("pause");
}
