Cod sursa(job #632074)
Utilizator | Data | 10 noiembrie 2011 11:51:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
unsigned long n;
bool a[2000000];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
a[2]=1;
a[3]=1;
for(int i=5;i<=n;i=i+6)
a[i]=!a[i];
for(int i=7;i<=n;i=i+6)
a[i]=!a[i];
for(int i=1;i<=n;i++)
if(a[i])g<<i<<' ';
g<<'\n';
f.close();
g.close();
return 0;
}