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