Update subtree-removal-game-with-fibonacci-tree.py

Author: kamyu104

Python/subtree-removal-game-with-fibonacci-tree.py

@@ -34,4 +34,4 @@ def findGameWinner(self, n):
         grundy = [0, 1]  # 0-indexed
         for i in xrange(2, n):
             grundy[i%2] = (grundy[(i-1)%2]+1)^(grundy[(i-2)%2]+1)  # colon principle, replace the branches by a non-branching stalk of length equal to their nim sum
-        return grundy[(n-1)%2]
+        return grundy[(n-1)%2] > 0