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 1bb57c2 commit f156f45Copy full SHA for f156f45
project_euler/problem_136/sol1.py
@@ -33,6 +33,10 @@ def solution(n_limit: int = 50 * 10**6) -> int:
33
Define n count list and loop over delta, y to get the counts, then check
34
which n has count == 1.
35
36
+ >>> solution(3)
37
+ 0
38
+ >>> solution(10)
39
+ 2
40
>>> solution(21)
41
1
42
>>> solution(100)
0 commit comments