-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem033.cc
More file actions
69 lines (63 loc) · 1.95 KB
/
Copy pathproblem033.cc
File metadata and controls
69 lines (63 loc) · 1.95 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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <iostream>
#include <utility>
#include <cstdint>
std::pair<std::uint16_t, std::uint16_t> reduce(std::uint16_t num,
std::uint16_t den);
bool test_fraction(std::uint16_t i, std::uint16_t j, std::uint16_t ik,
std::uint16_t jk);
int main(int argc, char **argv) {
std::uint16_t gnum = 1;
std::uint16_t gden = 1;
for (std::uint16_t i = 1; i < 10; ++i) {
for (std::uint16_t j = i; j < 10; ++j) {
for (std::uint16_t k = 1; k < 10; ++k) {
std::uint16_t num = 10 * i + k;
std::uint16_t den = 10 * j + k;
if (den > num && test_fraction(i, j, num, den)) {
gnum *= i;
gden *= j;
}
num = 10 * k + i;
den = 10 * j + k;
if (den > num && test_fraction(i, j, num, den)) {
gnum *= i;
gden *= j;
}
num = 10 * i + k;
den = 10 * k + j;
if (den > num && test_fraction(i, j, num, den)) {
gnum *= i;
gden *= j;
}
num = 10 * k + i;
den = 10 * k + j;
if (den > num && test_fraction(i, j, num, den)) {
gnum *= i;
gden *= j;
}
}
}
}
auto reduced = reduce(gnum, gden);
std::cout << reduced.second << '\n';
return 0;
}
std::uint16_t gcd(std::uint16_t a, std::uint16_t b) {
while (b) {
std::uint16_t tmp = a;
a = b;
b = tmp % b;
}
return a;
}
std::pair<std::uint16_t, std::uint16_t> reduce(std::uint16_t num,
std::uint16_t den) {
std::uint16_t frac_gcd = gcd(num, den);
return std::make_pair(num / frac_gcd, den / frac_gcd);
}
bool test_fraction(std::uint16_t i, std::uint16_t j, std::uint16_t ik,
std::uint16_t jk) {
std::pair<std::uint16_t, std::uint16_t> red_orig = reduce(i, j);
std::pair<std::uint16_t, std::uint16_t> red = reduce(ik, jk);
return red.first == red_orig.first && red.second == red_orig.second;
}