Cod sursa(job #695847)
| Utilizator |  Alex Belc alex.belc |
Data | 28 februarie 2012 15:08:26 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j;
f>>n;
int a[2000000]={0};
for (i=2;i<=n;i++)
{
if (a[i]==0)
for (j=i+i;j<=n+2;j=j+i)
{
a[j]=1;
}
}
for (i=1;i<=n;i++)
if (a[i]==0) g<<i<<" ";
f.close();
g.close();
return 0;
}