Cod sursa(job #1246631)
Utilizator | Data | 21 octombrie 2014 13:53:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g ("ciur.out");
bool v[2000000];
int prim(long n)
{int d, ok=1;
for(d=2;d<=sqrt(n);d++)
if(n%d==0)
ok=0;
return ok;
}
int main()
{long n,i;
f>>n;
//cin>>n;
for(i=1;i<=n;i++)
v[i]=prim(i);
for(i=1;i<=n;i++)
if(v[i]==1)
g<<i<<" ";
//cout<<i<<" ";
return 0;
}