上一页 1 ··· 8 9 10 11 12 13 14 15 16 ··· 43 下一页
摘要: How to eat more Banana时间限制:1000 ms | 内存限制:65535 KB难度:4描述A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. If the monkey is clever enough, it shall be able to rea 阅读全文
posted @ 2013-05-25 15:53 可笑痴狂 阅读(351) 评论(0) 推荐(0)
摘要: 吃土豆时间限制:1000 ms | 内存限制:65535 KB难度:4描述Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 1*1 grid. Now you want to eat the beans and collect the qualities, but everyone must obey by the following rul 阅读全文
posted @ 2013-05-25 10:43 可笑痴狂 阅读(362) 评论(0) 推荐(0)
摘要: Counting BlackTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9655Accepted: 6225DescriptionThere is a board with 100 * 100 grids as shown below. The left-top gird is denoted as (1, 1) and the right-bottom grid is (100, 100). We may apply three commands to the board: 1. WHITE x, y, L //... 阅读全文
posted @ 2013-05-21 22:54 可笑痴狂 阅读(379) 评论(0) 推荐(0)
摘要: See you~Time Limit: 5000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2508Accepted Submission(s): 798Problem DescriptionNow I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and I met so many good 阅读全文
posted @ 2013-05-20 22:53 可笑痴狂 阅读(483) 评论(0) 推荐(0)
摘要: River Crossing时间限制:1000 ms | 内存限制:65535 KB难度:4描述Afandi is herding N sheep across the expanses of grassland when he finds himself blocked by a river. A single raft is available for transportation.Afandi knows that he must ride on the raft for all crossings, but adding sheep to the raft makes it trave 阅读全文
posted @ 2013-05-17 20:53 可笑痴狂 阅读(383) 评论(0) 推荐(0)
摘要: 问 题 描 述 有N粒石子,甲乙两人轮流从中拿取,一次至少拿一粒,至多拿先前对方一次所取石子数目的两倍。甲先拿,开始甲可以拿任意数目的石子(但不得拿完)。最先没有石子可拿的一方为败方。 请问,甲能否获胜?(1 < N < 100)题解:设{F}为Fibonacci数列(F1=2,F2=3,FK=FK-1+FK-2) 初始时有N粒石子,若N∈{F}则先手必败,否则先手必胜。 阅读全文
posted @ 2013-05-16 12:21 可笑痴狂 阅读(255) 评论(0) 推荐(0)
摘要: 圈水池时间限制:3000 ms | 内存限制:65535 KB难度:4描述有一个牧场,牧场上有很多个供水装置,现在牧场的主人想要用篱笆把这些供水装置圈起来,以防止不是自己的牲畜来喝水,各个水池都标有各自的坐标,现在要你写一个程序利用最短的篱笆将这些供水装置圈起来!(篱笆足够多,并且长度可变)输入第一行输入的是N,代表用N组测试数据(1<=N<=10)第二行输入的是m,代表本组测试数据共有m个供水装置(3<=m<=100)接下来m行代表的是各个供水装置的横纵坐标 输出 输出各个篱笆经过各个供水装置的坐标点,并且按照x轴坐标值从小到大输出,如果x轴坐标值相同,再安照y轴坐标 阅读全文
posted @ 2013-05-07 20:56 可笑痴狂 阅读(492) 评论(0) 推荐(0)
摘要: 取(m堆)石子游戏Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 974Accepted Submission(s): 581Problem Descriptionm堆石子,两人轮流取.只能在1堆中取.取完者胜.先取者负输出No.先取者胜输出Yes,然后输出怎样取子.例如5堆 5,7,8,9,10先取者胜,先取者第1次取时可以从有8个的那一堆取走7个剩下1个,也可以从有9个的中那一堆取走9个剩下0个,也可以从有10个的中那一堆取走7个剩下3个. 阅读全文
posted @ 2013-05-01 11:43 可笑痴狂 阅读(302) 评论(0) 推荐(0)
摘要: Being a Good Boy in Spring FestivalTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2720Accepted Submission(s): 1559Problem Description一年在外 父母时刻牵挂春节回家 你能做几天好孩子吗寒假里尝试做做下面的事情吧陪妈妈逛一次菜场悄悄给爸爸买个小礼物主动地 强烈地 要求洗一次碗某一天早起 给爸妈用心地做回早餐如果愿意 你还可以和爸妈说咱们玩个小游戏吧 ACM课上学 阅读全文
posted @ 2013-05-01 10:30 可笑痴狂 阅读(281) 评论(0) 推荐(0)
摘要: Good Luck in CET-4 Everybody!Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3204Accepted Submission(s): 2008Problem Description大学英语四级考试就要来临了,你是不是在紧张的复习?也许紧张得连短学期的ACM都没工夫练习了,反正我知道的Kiki和Cici都是如此。当然,作为在考场浸润了十几载的当代大学生,Kiki和Cici更懂得考前的放松,所谓“张弛有道”就是这个意思。 阅读全文
posted @ 2013-05-01 10:00 可笑痴狂 阅读(284) 评论(0) 推荐(0)
上一页 1 ··· 8 9 10 11 12 13 14 15 16 ··· 43 下一页