Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Euclid
- int gcd(int a, int b) {
- if (b == 0) return a;
- return gcd(b, a % b);
- }
- //Eratosthene
- void eratosthene() {
- for (int i = 0; i < N; i++) {
- prime[i] = true;
- }
- prime[1] = false;
- for (int i = 2; i < N; i++) {
- for (int j = i * i; j < N; j += i) {
- prime[j] = false;
- }
- }
- //print prime numbers
- for (int i = 2; i < N; i++) {
- if (prime[i]) cout << i << " ";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment