Cod sursa(job #632081)
Utilizator | Apostol Alexandru Ionut alexapo | Data | 10 noiembrie 2011 11:58:56 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <iostream>
using namespace std;
unsigned long n;
int a[2000000];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
cin>>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])cout<<i<<' ';
for(int i=10;i<=n;i=i+5)
a[i]=0;
for(int i=14;i<=n;i=i+7)
a[i]=0;
//g<<'\n';
f.close();
g.close();
return 0;
}