Cod sursa(job #788310)
Utilizator | Data | 14 septembrie 2012 14:41:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[10001],n,i,m,j;
int main ()
{
f>>n;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
for(j=2*i;j<=n;j=j+i)
v[j]=1;
g<<i<<" ";
}
}
f.close();g.close();
return 0;
}