Cod sursa(job #878313)

Utilizator toranagahVlad Badelita toranagah Data 14 februarie 2013 12:18:42
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.37 kb
#include <cmath>
#include <fstream>
using namespace std;
const int MAX_N = 2100100;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[MAX_N];

int main() {
	int N;
	fin >> N;
	int numFound = 0;
	for (int i = 2; i <= sqrt(N); ++i) {
		if (ciur[i] == 0) {
			for (int j = i * i; j <= N; j += i) {
				ciur[j] = 1;
			}
			++numFound;
		}
	}
	fout << numFound;
	return 0;
}