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 6639f18 commit 8f23ddcCopy full SHA for 8f23ddc
1 file changed
project_euler/problem_136/sol1.py
@@ -33,10 +33,8 @@ 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
+ >>> solution(21)
+ 1
40
>>> solution(100)
41
25
42
>>> solution(110)
0 commit comments