Cod sursa(job #232831)
Utilizator | Rauca Ioan David david_rauca | Data | 16 decembrie 2008 09:01:49 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream.h>
int a[30000], i, j, n;
int main()
{
ifstream fin ("ciur.in");
fin >> n;
fin.close();
ofstream fout ("ciur.out");
for ( i = 0; i < n; i++ )
a[i] = 1;
for ( i = 2; i * i <= n; i++ )
if ( a[i] )
{
j = 2;
while ( i * j <= n )
{
a[i * j] = 0;
j++;
}
}
for ( i = 2; i <= n; i++ )
if ( a[i] )
fout << i << ' ';
fout.close();
return 0;
}