摘要： A New Tetris GameTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 929Accepted Submission(s): 422 Problem Description曾经，Lele和他姐姐最喜欢，玩得最久的游戏就是俄罗斯方块(Tetris)了。 渐渐得，Lele发觉，玩这个游戏只需要手快而已，几乎不用经过大脑思考。 所以，Lele想出一个新的玩法。Lele和姐姐先拿出一块长方形的棋盘，这个棋盘有些格子是不可用的，剩下的都是可用 阅读全文

摘要： A Chess GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1100 Accepted Submission(s): 504 Problem DescriptionLet's design a new chess game. There are N positions to hold M chesses in this game. Multiple chesses can be located in the same p 阅读全文

摘要： S-NimProblem DescriptionArthur and his sister Caroll have been playing a game called Nim for some time now. Nim is played as follows:The starting position has a number of heaps, all containing some, not necessarily equal, number of beads.The players take turns chosing a heap and removing a positive. 阅读全文

摘要： 以下是我从网上收集的关于组合博弈的资料汇总：有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。 显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。因此我们发现了如何取胜的法则：如果n=（m+1）r+s，（r为任意. 阅读全文

摘要： MineTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 352 Accepted Submission(s): 94 Problem DescriptionHave you ever played a game in Windows: Mine? This game is played on a n*m board, just like the Pic(1) On the board, Under some grids there ar.. 阅读全文