We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1307efe commit ca62468Copy full SHA for ca62468
project_euler/problem_057/sol1.py
@@ -31,17 +31,17 @@ def solution(n: int = 1000) -> int:
31
>>> solution(10000)
32
1508
33
"""
34
- a, b = 1, 1
35
- res = []
+ prev_numerator, prev_denominator = 1, 1
+ result = []
36
for i in range(1, n + 1):
37
- numerator = a + 2 * b
38
- denominator = a + b
+ numerator = prev_numerator + 2 * prev_denominator
+ denominator = prev_numerator + prev_denominator
39
if len(str(numerator)) > len(str(denominator)):
40
- res.append(i)
41
- a = numerator
42
- b = denominator
+ result.append(i)
+ prev_numerator = numerator
+ prev_denominator = denominator
43
44
- return len(res)
+ return len(result)
45
46
47
if __name__ == "__main__":
0 commit comments