摘要： 取石子游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 812Accepted Submission(s): 435Problem Description1堆石子有n个,两人轮流取.先取者第1次可以取任意多个，但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".Input输入有多组.每组第1行是2<=n&l 阅读全文

摘要： 邂逅明下Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 678Accepted Submission(s): 323Problem Description当日遇到月，于是有了明。当我遇到了你，便成了侣。那天，日月相会，我见到了你。而且，大地失去了光辉，你我是否成侣？这注定是个凄美的故事。（以上是废话）小t和所有世俗的人们一样，期待那百年难遇的日食。驻足街头看天，看日月渐渐走近，小t的脖子那个酸呀（他坚持这个姿势已经有半个多小时啦）。他低下仰起的 阅读全文

摘要： A Simple GameTime Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/65535K (Java/Other)Total Submission(s) : 2Accepted Submission(s) : 2Problem DescriptionAgrael likes play a simple game with his friend Animal during the classes. In this Game there are n piles of stones numbered from 1 to n, the 阅读全文

摘要： 悼念512汶川大地震遇难同胞——选拔志愿者Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1858Accepted Submission(s): 1050Problem Description对于四川同胞遭受的灾难，全国人民纷纷伸出援助之手，几乎每个省市都派出了大量的救援人员，这其中包括抢险救灾的武警部队，治疗和防疫的医护人员，以及进行心理疏导的心理学专家。根据要求，我校也有一个奔赴灾区救灾的名额，由于广大师生报名踊跃，学校不得不进行选拔来决定 阅读全文

摘要： Rabbit and GrassTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 559Accepted Submission(s): 432Problem Description大学时光是浪漫的，女生是浪漫的，圣诞更是浪漫的，但是Rabbit和Grass这两个大学女生在今年的圣诞节却表现得一点都不浪漫：不去逛商场，不去逛公园，不去和AC男约会，两个人竟然猫在寝食下棋……说是下棋，其实只是一个简单的小游戏而已，游戏的规则是这样的：1、棋盘包含1* 阅读全文

摘要： A multiplication gameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4108Accepted: 1981DescriptionStan 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 number 阅读全文

摘要： A Multiplication GameTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1275Accepted Submission(s): 773Problem 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 阅读全文

摘要： Be the WinnerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 504Accepted Submission(s): 247Problem DescriptionLet's consider m apples divided into n groups. Each group contains no more than 100 apples, arranged in a line. You can take any numbe 阅读全文

摘要： JohnTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 831Accepted Submission(s): 437Problem DescriptionLittle John is playing very funny game with his younger brother. There is one big box filled with M&Ms of different colors. At first John has t 阅读全文

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1404本文作者：kuangbin转载请注明出处。 www.cnblogs.com/kuangbin题目：Digital DeletionsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 785Accepted Submission(s): 287Problem DescriptionDigital deletions is a two-player 阅读全文