Cod sursa(job #2273086)
Utilizator | Data | 30 octombrie 2018 23:44:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ long n,i,j;
ifstream f("ciur.in");
f>>n;
f.close();
int v[n+1];
for(i=2;i<=n;i++)
v[i]=0;
for(i=2;i<n;i++)
if(v[i]==0){
for(j=i*2;j<=n;j+=i)
v[j]++;
}
ofstream g("ciur.out");
for(i=2;i<=n;i++)
if(v[i]==0){
g<<i<<" ";
}
g.close();
return 0;
}