HackerRank "Nimble Game"
2017-12-27 11:55
465 查看
A simple NIM game in disguise: move 1 coin to one of previous slot, equals to removing..
Then no surprise, Sprague-Grundy theorem solves the problem.
Then no surprise, Sprague-Grundy theorem solves the problem.
相关文章推荐
- HackerRank "Chessboard Game, Again!"
- HackerRank "Manasa and Prime game"
- HackerRank "Permutation game"
- HackerRank - "The Longest Increasing Subsequence"
- HackerRank "Minimum Penalty Path"
- HackerRank "Kruskal (MST): Really Special Subtree"
- HackerRank "Xor and Sum"
- HackerRank: Bricks Game
- HackerRank - powers-game-1 【博弈论】
- HackerRank "Jumping on the Clouds"
- HackerRank "TBS Problem" ~ NPC
- HackerRank "Chocolate in Box" !
- HackerRank - "Snakes and Ladders: The Quickest Way Up"
- 【HackerRank】【HourRank 20】Birjik and Nicole's Tree Game
- Bricks Game(HackerRank play-game)
- HackerRank "Array and simple queries" !
- HackerRank "Equal Stacks"
- HackerRank "K Factorization"
- HackerRank - "Stars"
- HackerRank "Simplified Chess Engine I & II"