We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent de23d74 commit 15bf2a6Copy full SHA for 15bf2a6
solutions/project-euler/023/023.py
@@ -26,7 +26,10 @@ def is_abundant(number):
26
27
for i in abundant_numbers_below_limit:
28
for j in abundant_numbers_below_limit:
29
- if i + j <= LIMIT and i + j not in numbers_that_are_sum_of_two_abundant:
+ if (
30
+ i + j <= LIMIT
31
+ and i + j not in numbers_that_are_sum_of_two_abundant
32
+ ):
33
numbers_that_are_sum_of_two_abundant.add(i + j)
34
sum_numbers_that_are_sum_of_two_abundant += i + j
35
solutions/project-euler/029/029.py
@@ -1,5 +1,5 @@
1
results = set()
2
for i in range(2, 101):
3
for j in range(2, 101):
4
- results.add(i ** j)
+ results.add(i**j)
5
print(len(results))
0 commit comments