-
Notifications
You must be signed in to change notification settings - Fork 0
/
Euler_65.cpp
58 lines (42 loc) · 1.17 KB
/
Euler_65.cpp
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
#include <numeric>
#include "Euler.h"
std::vector<cpp_int> recurseFraction2(std::vector<cpp_int> period, cpp_int n, std::vector<cpp_int> fraction)
{
if (n > period.size() - 1)
return fraction;
std::swap(fraction[0], fraction[1]);
fraction[0] = (fraction[1] * period[period.size() - n - 1]) + fraction[0];
return recurseFraction2(period, n + 1, fraction);
}
std::vector<cpp_int> recurseFraction2(std::vector<cpp_int> period, cpp_int n)
{
std::vector<cpp_int> fraction;
fraction.push_back(period[period.size() - 1]);
fraction.push_back(1);
return recurseFraction2(period, 1, fraction);
}
cpp_int periodiuy()
{
std::vector<cpp_int> period;
period.push_back(2);
int n = 2;
for (int i = 1; i < 100; ++i)
{
if (i % 3 == 2)
{
period.push_back(n);
n += 2;
}
else
{
period.push_back(1);
}
}
std::vector<cpp_int> approx = recurseFraction2(period, 0);
return approx[0];
}
int Euler::ConvergentsOfE()
{
std::vector<int> digits = EulerUtility::BigIntToDigits(periodiuy());
return std::accumulate(digits.begin(), digits.end(), 0);
}