Cod sursa(job #2291851)
Utilizator | Data | 28 noiembrie 2018 18:24:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool a[2000041];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,e;
f>>n;
for(int i=2;i*i<=n;i++){
if(a[i]==false){
g<<i<<" ";
for(int j=i;j<=n;j+=i){
a[j]=true;
}
}
e=i;
}
for(int f=e;f<=n;f++){
if(a[f]==false)
g<<f<<" ";
}
return 0;
}