摘要: Find The MultipleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12097Accepted: 4968Special JudgeDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater . 阅读全文
posted @ 2012-07-22 21:47 cseriscser 阅读(2134) 评论(0) 推荐(0) 编辑
摘要: A Funny GameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2979Accepted: 1722DescriptionAlice and Bob decide to play a funny game. At the beginning of the game they pick n(1 <= n <= 106) coins in a circle, as Figure 1 shows. A move consists in removing one or two adjacent coins, leav 阅读全文
posted @ 2012-07-22 20:18 cseriscser 阅读(908) 评论(0) 推荐(0) 编辑
摘要: NimTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3591Accepted: 1623DescriptionNim 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 more stones from any single pile. Play ends when all the stone. 阅读全文
posted @ 2012-07-22 16:27 cseriscser 阅读(377) 评论(0) 推荐(0) 编辑
摘要: Matches GameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6537Accepted: 3739DescriptionHere 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 . 阅读全文
posted @ 2012-07-22 15:04 cseriscser 阅读(136) 评论(0) 推荐(0) 编辑
摘要: A multiplication gameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4350Accepted: 2147DescriptionStan 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 his multiplication, then Ollie multiplies the numbe. 阅读全文
posted @ 2012-07-22 14:52 cseriscser 阅读(274) 评论(0) 推荐(0) 编辑