Cod sursa(job #1684758)
Utilizator | Data | 11 aprilie 2016 11:52:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
int n,i,j,ciur[2000005];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(int i = 4; i<= n; i+=2) ciur[i] = 1;
for(int i = 3; i<= n; i+=2)
{
if(ciur[i] == 1) continue;
for(int j = i*i; j<= n; j+=i)
{
ciur[j] = 1;
}
}
for(i=2;i<=n;i++)
if(!ciur[i])
g<<i<<" ";
}