Cod sursa(job #629591)
Utilizator | Data | 3 noiembrie 2011 15:51:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream.h>
fstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j;
bool a[2000001];
bool prim(int x)
{
int i;
for(i=2;i<=sqrt(x);i++)
if(x%i==0)
return 0;
return 1;
}
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(!a[i])
{
if(prim(i))g<<i<<' ';
for(j=i;j<=n;j=j+i)
a[j]=true;
}
g<<'\n';
f.close();
g.close();
return 0;
}