Cod sursa(job #1262152)

Utilizator NeapoleonDan-Mihai Bradu Neapoleon Data 12 noiembrie 2014 23:51:42
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.33 kb
#include<fstream>

using namespace std;

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

int i,j,k,n;

bool ciur[2000005];

int main()
{
	cin>>n;
	int nmax=2000005;
	for(i=2;i<=nmax;++i){
		if(!ciur[i]) for(j=2;i*j<nmax;++j)ciur[i*j]=1;
	}
	for(i=2;i<=n;++i) 
		if(!ciur[i])++k;
	cout<<k;
	
	return 0;
}