Cod sursa(job #569271)
| Utilizator | Data | 1 aprilie 2011 11:25:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int p[100000], n, i, j;
fin >> n;
for ( i = 1; i <= n; i++ )
p[i] = 1;
p[1] = 0;
for ( i = 2; i * i <= n; i++ )
if (p[i] == 1)
for ( j = i * 2; j <= n; j = j + i)
p[j] = 0;
for ( i = 1; i <= n; i++)
if(p[i]==1) fout << i << " ";
fin.close();
fout.close();
return 0;
}