Cod sursa(job #2499959)

Utilizator radustn92Radu Stancu radustn92 Data 27 noiembrie 2019 00:01:47
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.37 kb
Raporteaza aceasta sursa 
#include <cstdio>
#include <bitset>
using namespace std;
const int NMAX = 2000505;
bitset<NMAX> mark;
int N;

int main() {
	freopen("ciur.in", "r", stdin);
	freopen("ciur.out", "w", stdout);

	scanf("%d", &N);
	for (int i = 2; i <= N; i++) {
		if (!mark[i]) {
			for (int j = 2 * i; j <= N; j += i) {
				mark[j] = 1;
			}
		}
	}

	printf("%d\n", N - 1 - mark.count());
	return 0;
}