Cod sursa(job #232953)
Utilizator | Data | 16 decembrie 2008 15:37:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream.h>
#include<string.h>
bool ok[2000000];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, j, i, p = 0;
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] = 0;
j++;
}
}
for (i = 2; i <= n; i++)
if(ok[i]) fout << i << ' ';
fout << '\n';
fin.close();
fout.close();
return 0;
}