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 24895ca commit 26604eaCopy full SHA for 26604ea
Python/subtree-removal-game-with-fibonacci-tree.py
@@ -9,11 +9,11 @@ def findGameWinner(self, n):
9
"""
10
# a pattern appears every 6 grundy numbers in binary forms:
11
# 0000, (0000)01, (0000)11, ((0000)^(0000+1))10, (0000)11, (0000)11
12
- # 0000, (0000+1)01, (0000+1)11, (((0000+1))^((0000+1)+1))10, (0000+1)11, (0000+1)11
13
- # 0000, ((0000+1)+1)01, ((0000+1)+1)11, ((((0000+1)+1))^(((0000+1)+1)+1))10, ((0000+1)+1)11, ((0000+1)+1)11
+ # 0000, (0000+1)01, (0000+1)11, ((0000+1)^((0000+1)+1))10, (0000+1)11, (0000+1)11
+ # 0000, ((0000+1)+1)01, ((0000+1)+1)11, (((0000+1)+1)^(((0000+1)+1)+1))10, ((0000+1)+1)11, ((0000+1)+1)11
14
# ...
15
# 0000, (XXXX)01, (XXXX)11, ((XXXX)^(XXXX+1))10, (XXXX)11, (XXXX)11
16
- # 0000, (XXXX+1)01, (XXXX+1)11, (((XXXX+1))^((XXXX+1)+1))10, (XXXX+1)11, (XXXX+1)11
+ # 0000, (XXXX+1)01, (XXXX+1)11, ((XXXX+1)^((XXXX+1)+1))10, (XXXX+1)11, (XXXX+1)11
17
# => grundy[6k+1] = 0
18
# grundy[6k+2] = 4k+1
19
# grundy[6k+3] = 4k+3
0 commit comments