Jan 3, 2025 · Jan 6, 2025 · Jan 8, 2025 · Jan 3, 2025 · Jan 3, 2025
diff --git a/snippets/cpp/math-and-numbers/sieve-of-eratosthenes.md b/snippets/cpp/math-and-numbers/sieve-of-eratosthenes.md
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,29 @@
	---
	title: Sieve of Eratosthenes
	description: Generates all prime numbers up to a given maximum value using an efficient algorithm.
	author: muriloguizelin
	tags: number-theory, prime, sieve
	---
	```cpp

	#include <vector>

	const int MAXN = 1e6 + 1;
	std::vector<bool> isPrime(MAXN, true);

	void sieve() {
	isPrime[0] = isPrime[1] = false;

	for (int i = 2; i * i < MAXN; ++i) {
	if (isPrime[i]) {
	for (int j = i * i; j < MAXN; j += i) {
	isPrime[j] = false;
	}
	}
	}
	}

	// Usage:.
Copy link Collaborator @majvax majvax Jan 3, 2025 Choose a reason for hiding this comment The reason will be displayed to describe this comment to others. Learn more. Remove the dot `.` after the colon `:`
	sieve();
	if (isPrime[29]) std::cout << "29 is a prime number!" << std::endl;
	```