摘要：
A Simple Nim Problem Description Two players take turns picking candies from n heaps,the player who picks the last one will win the game.On each turn 阅读全文
摘要：
Fibonacci again and again Problem Description 任何一个大学生对菲波那契数列(Fibonacci numbers)应该都不会陌生，它是这样定义的：F(1)=1;F(2)=2;F(n)=F(n-1)+F(n-2)(n>=3);所以，1,2,3,5,8,13… 阅读全文
摘要：
S-Nim Problem Description Arthur and his sister Caroll have been playing a game called Nim for some time now. Nim is played as follows: The starting p 阅读全文
摘要：
Be the Winner Problem Description Let's consider m apples divided into n groups. Each group contains no more than 100 apples, arranged in a line. You 阅读全文
摘要：
John Problem Description Little John is playing very funny game with his younger brother. There is one big box filled with M&Ms of different colors. A 阅读全文
摘要：
D. Developing Game Pavel is going to make a game of his dream. However, he knows that he can't make it on his own so he founded a development company 阅读全文