kongming_acm的专栏

A multiplication gameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3560 Accepted: 1669<br />DescriptionStan and Ollie play the game of multiplication by multiplying an integer p by one of the numbers 2 to 9. Stan always starts with p = 1, does

Two best friends Serozha and Gena play a game.Initially there is one pile consisting of n stones on the table. During one move one pile should be taken and divided into an arbitrary number of pile

Fire and Lam are addicted to the game of Go recently. Go is one of the oldest board games. It is rich in strategy despite its simple rules.

Problem DescriptionAs we know,daizhenyang likes playing chess,but he always lose,so one day,he invented a brand new chess game with the ne

Problem DescriptionAekdycoin and abcdxyzk are playing a game. They get a circle chain with some beads. Initially none of the beads is pain

The game goes like this: Two players start the game with a circle of n coins. They take coins from the circle in turn and every time the

2699: 16 and 18ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s8192K8224Standard<br />16 and 18 are good friends. They are playing a game.<br /><br />The rules are as following:<br /><br />(1) 16 and 18 will give numbers in turn. At first 16, then 18,

JohnTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 553    Accepted Submission(s): 275Problem DescriptionLittle John is playing very funny game with his younger brother. There is one big box filled wi

Be the WinnerTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 323    Accepted Submission(s): 142Problem DescriptionLet's consider m apples divided into n groups. Each group contains no more than 100 ap

 2608: 石子ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s131072K469116StandardXiao Tang和Xiao Jiang非常喜欢玩一种有趣的小游戏: 有N个石子，两人轮流从中取出1个, 3个或4个石子，当石子被取空时，游戏结束。最后一个取石子的人获胜, 第一次总是Xiao Tang取. 当然，他们俩都足够聪明，总会采取最优的策略。Input每行会有一个正整数N(N输出获胜人的名字。Sample Input120S

取石子游戏Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20470 Accepted: 6343<br />Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目，如果轮到你先取，假设双方都采取最好的策略，问最后你是胜者还是败者。<br />In

Calendar GameTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2802 Accepted: 1196<br />DescriptionAdam and Eve enter this year's ACM International Collegiate Programming Contest. Last night, they played the Calendar Game, in celebration of this co

Georgia and BobTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3404 Accepted: 783<br />DescriptionGeorgia and Bob decide to play a self-invented game. They draw a row of grids on paper, number the grids from left to right by 1, 2, 3, ..., and pla

S-NimTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 1005 Accepted: 571DescriptionArthur 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 con

NimTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 2426 Accepted: 1022 DescriptionNim is a 2-player game featuring several piles of stones. Players alternate turns, and on his/her turn, a player’s move consists of removing one or m

<br />2234 Matches Game<br />Description<br />Here is a simple game. In this game, there are several piles of matches and two players. The two player play in turn. In each turn, one can choose a pile and take away arbitrary number of matches from the pile

Problem DescriptionThere is a rectangle area (with N rows and M columns) in front of Ali and Baba, each grid might be one of the following:1. Empty area, represented by an integer 0.2. A Stone,