Cod sursa(job #702987)

Utilizator alexdmotocMotoc Alexandru alexdmotoc Data 2 martie 2012 10:21:27
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.44 kb
#include <cstdio>

using namespace std;

#define maxN 2000005

int N;
bool p[maxN];

int main ()
{
	freopen ("ciur.in" , "r" , stdin);
	freopen ("ciur.out" , "w" , stdout);
	
	scanf ("%d" , &N);
	
	for (int i = 2 ; i <= N ; ++i)
		if (!p[i])
			for (int j = i + i ; j <= N ; j += i)
				p[j] = true;
	
	
	int cont = 0;
	
	for (int i = 2 ; i <= N ; ++i)
		if (!p[i])
			++cont;
	
	
	printf ("%d" , cont);
	
	return 0;
}