Cod sursa(job #963734)

Utilizator Luncasu_VictorVictor Luncasu Luncasu_Victor Data 18 iunie 2013 22:48:21
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");

#ifndef _ciur_h
#define _ciur_h

#include <bitset>
#include <vector>
#include <cmath>
#define max_size 2000013

class ciur
{
public:
	ciur(){ generate(); }
	void generate(){
		int i = 2, l = (int)sqrt(max_size);
		for(int i=2;i<max_size;i++) bit[i]=1;
		while(i <= l)
		{
			if(!bit[i]){ i++; continue; }
			for(int j=i*i;j<max_size;j+=i) bit[j] = 0;
			i++;
		}
	}
	bool isprime(int x){
		return bit[x];
	}
private:
    bitset<max_size>bit;
};

#endif

int n, x = 0;
ciur a;

int main() 
{
	f >> n;
	for(int i=0;i<n;i++)
		if(a.isprime(i)) x++;
	g << x << endl;
    return 0;
}