Cod sursa(job #1537902)
Utilizator | Data | 28 noiembrie 2015 11:44:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool v[200000001];
int main()
{
int i,n,j;
in>>n;
for(i=2; i<=n; i++)
if(v[i]==0)
for(j=i+1; j<=n; j++)
if(j%i==0)
v[j]=1;
for(i=2; i<=n; i++)
if(v[i]==0)
out<<i<<" ";
return 0;
}