Cod sursa(job #1651290)

Utilizator avneacsuAlexandra Neacsu avneacsu Data 12 martie 2016 22:50:15
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <iostream>
#include <fstream>
//#include "definitions.h"

#define MAX_N 200000
using namespace std;


bool isPrimeNumber(int n) {
	for (int i = 2; i<=n/2; i++) 
		if (n%i == 0) return false;
	return true;
}

int countPrimes(int n) {
	bool sieve[MAX_N];

	int count = 0;
	for (int i = 0; i<n; i++)
		sieve[i] = true;

	int step = 2;
	count = 0;
	for (int i = 2; i<n; i++) {
		if (sieve[i] == true) {
			for (int index = i; index < n; index+=i) {
				sieve[index] = false;
			}
			count++;
		}
	}
	
	return count;
}

int main() {
	ifstream f("ciur.in");
    ofstream g("ciur.out");
    int n;
    f>>n;
	g<<countPrimes(n);
	return 0;
}