Cod sursa(job #1028658)
Utilizator | Data | 14 noiembrie 2013 15:32:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int a[2000005],v[2000005],n;
int main()
{
f>>n;
for(int i=1;i<=n;i++){
a[i]=i+1;
v[i]=0;
}
for(int i=1;i<=n;i++){
if(v[i]==0){
for(int j=i+i;i<=n;j=j+i){
v[j]=1;
}
}
}
for(int i=1; i<=n;i++){
if(v[i]==0){
g<<a[i]<<" ";
}
}
return 0;
}