Cod sursa(job #642371)
Utilizator | Data | 1 decembrie 2011 10:24:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
long long v[20000005],n,i,j;
f>>n;
for(i=1;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i]==1)
{
g<<i;
for(j=i+i;j<=n;j=j+i)
v[j]=0;
}
f.close();
g.close();
return 0;
}