-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathproblem69.h
More file actions
42 lines (36 loc) · 1.08 KB
/
problem69.h
File metadata and controls
42 lines (36 loc) · 1.08 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
//
// Created by Allison Zhuang on 5/8/22.
//
#ifndef PROJECT_EULER_PROBLEM69_H
#define PROJECT_EULER_PROBLEM69_H
#include "iostream"
using namespace std;
void problem_69_solution(bool log) {
int primes[100] = {
2, 3, 5, 7, 11, 13,
17, 19, 23, 29, 31, 37,
41, 43, 47, 53, 59, 61,
67, 71, 73, 79, 83, 89,
97, 101, 103, 107, 109, 113,
127, 131, 137, 139, 149, 151,
157, 163, 167, 173, 179, 181,
191, 193, 197, 199, 211, 223,
227, 229, 233, 239, 241, 251,
257, 263, 269, 271, 277, 281,
283, 293, 307, 311, 313, 317,
331, 337, 347, 349, 353, 359, 367,
373, 379, 383, 389, 397, 401, 409,
419, 421, 431, 433, 439, 443, 449,
457, 461, 463, 467, 479, 487, 491,
499, 503, 509, 521, 523, 541
};
int product = 1;
int i = 0;
while(product <= 1000000) {
product *= primes[i];
i++;
}
product/= primes[i-1];
if (log) cout << product << endl;
}
#endif //PROJECT_EULER_PROBLEM69_H