Cod sursa(job #1007397)
Utilizator | Data | 8 octombrie 2013 21:22:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int n,j,i,nr,p[100004];
bool ok;
int main()
{
f>>n;
nr=1;
p[1]=2;
for (i=3;i<=n;i+=2)
{
ok=true;
for (j=1;j<=nr && ok && p[j]*p[j]<=i;j++)
if (i%p[j]==0)
ok=false;
if (ok)
p[++nr]=i;
}
for (i=1;i<=nr;i++)
g<<p[i]<<" ";
return 0;
}