Cod sursa(job #629472)
| Utilizator |  Apostol Alexandru Ionut alexapo |
Data | 3 noiembrie 2011 13:54:03 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
# include <fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
unsigned long n;
bool a[2000000];
int main()
{
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;
}