Cod sursa(job #2531359)

Utilizator RobysenLazarov Robert Robysen Data 26 ianuarie 2020 10:30:58
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.43 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");

#define nMax 2000005

int main() {
	int n, prime = 1, v[nMax];
	f >> n;
	for (int i = 1; ((i * i) << 1) + (i << 1) <= n; i++) {
		if (v[i]) {
			for (int j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= n; j += (i << 1) + 1)
				v[j] = 0;
		}
	}
	for (int i = 1; 2 * i + 1 <= n; i++)
		if (v[i]) prime++;
	g << prime;
}