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

摘要： Tiles of Tetris, NOT!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 569Accepted Submission(s): 229Problem DescriptionYou’ve really messed up this time. “Go buy some square tiles” your supervisor told you. But as usual, you were either busy reading 阅读全文

摘要： Probability OneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 301Accepted Submission(s): 224Problem DescriptionNumber guessing is a popular game between elementary-school kids. Teachers encourage pupils to play the game as it enhances their arithm 阅读全文

摘要： Not So Flat After AllTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 517Accepted Submission(s): 209Problem DescriptionAny positive integer v can be written as p1 a1 * p2 a2 * . . . pnan where pi is a prime number and ai >= 0. For example: 24 = 2 阅读全文