Cod sursa(job #2084557)
Utilizator | Data | 9 decembrie 2017 10:46:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool a[2000001];
int main()
{
int n;
fin>>n;
for(int i=2;i<=n;i++){
if(a[i]==0){
for(int j=2*i;j<=n;j+=i){
a[j]=1;
}
}
}
for(int i=2;i<=n;i++){
if(a[i]==0){
fout<<i<<" ";
}
}
return 0;
}