Cod sursa(job #632097)

Utilizator alexapoApostol Alexandru Ionut alexapo Data 10 noiembrie 2011 12:11:46
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include <fstream>
//#include <iostream>
using namespace std;
unsigned long n;
bool a[2000000];


int main()
{
    ifstream f("ciur.in");
ofstream g("ciur.out");
	f>>n;

	a[2]=true;
	a[3]=true;
	for(int i=5;i<=n;i=i+6)
		a[i]=true;
		for(int i=7;i<=n;i=i+6)
		a[i]=true;
		for(int i=4;i<=n;i=i+2)
		a[i]=false;
		for(int i=6;i<=n;i=i+3)
		a[i]=false;
		for(int i=14;i<=n;i=i+7)
		a[i]=false;
		for(int i=1;i<=n;i++)
		if(a[i])g<<i<<' ';
	g<<'\n';
		f.close();
		g.close();
		return 0;
}