Cod sursa(job #1800277)
Utilizator | Data | 7 noiembrie 2016 17:10:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,v[2000005],i,j;
int main()
{
fin>>N;
v[1]=1;
for(i=1;i<=N;i++)
{
if(v[i]==0)
{
for(j=2;i*j<=N;j++)
{
v[i*j]=1;
}
}
}
for(i=1;i<=N;i++)
{
if(v[i]==0)
{
fout<<i<<" ";
}
}
return 0;
}