Cod sursa(job #392205)

Utilizator toniobFMI - Barbalau Antonio toniob Data 6 februarie 2010 23:23:03
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.43 kb
#include <fstream>
using namespace std;

ifstream in ( "ciur.in" );
ofstream out ( "ciur.out" );

int N;

void ciur ( int N )
{
	int v [ N ], cnt = 0;
	
	for ( int i = 1; i <= N; ++i )
		v [ i ] = true;
	for ( int i = 2; i <= N; ++i )
		if ( v [ i ] )
		{
			++cnt;
			for ( int j = i + i; j <= N; j += i )
				v [ j ] = false;
		}
		
	out << cnt;
}

int main ()
{
	in >> N;
	
	ciur ( N );
	
	return 0;
}