Solve first 70% problem 161.
This commit is contained in:
@@ -35,7 +35,7 @@ def euler_111():
|
||||
for p in get_permutations(base, 2):
|
||||
if is_prime(p):
|
||||
subresult += p
|
||||
assert subresult > 0, "More than to permutations required to yield prime"
|
||||
assert subresult > 0, "More than two permutations required to yield prime"
|
||||
result += subresult
|
||||
return result
|
||||
|
||||
|
||||
Reference in New Issue
Block a user