上一页 1 ··· 5 6 7 8 9 10 11 12 下一页
摘要: 猜数字Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 169 Accepted Submission(s): 139Problem DescriptionA有1数m,B来猜.B每猜一次,A就说"太大","太小"或"对了" 。 问B猜n次可以猜到的最大数。Input第1行是整数T,表示有T组数据,下面有T行 每行一个整数n (1 ≤ n ≤ 30)Output猜n次可以猜到的最大数Sa 阅读全文
posted @ 2012-08-31 22:19 YogyKwan 阅读(135) 评论(0) 推荐(1) 编辑
摘要: Dome of CircusTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 283 Accepted Submission(s): 139Problem DescriptionA travelling circus faces a tough challenge in designing the dome for its performances. The circus has a number of shows that happen . 阅读全文
posted @ 2012-08-31 22:10 YogyKwan 阅读(252) 评论(0) 推荐(1) 编辑
摘要: Turn the cornerTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 336 Accepted Submission(s): 141Problem Description Mr. West bought a new car! So he is travelling around the city.One day he comes to a vertical corner. The street he is currently in . 阅读全文
posted @ 2012-08-31 21:50 YogyKwan 阅读(256) 评论(0) 推荐(1) 编辑
摘要: Strange fuctionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 269 Accepted Submission(s): 233Problem DescriptionNow, here is a fuction: F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 <= x <=100) Can you find the minimum value when x is between 0 a 阅读全文
posted @ 2012-08-31 21:28 YogyKwan 阅读(194) 评论(0) 推荐(1) 编辑
摘要: Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 412 Accepted Submission(s): 237Problem DescriptionNow,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100; Now please try . 阅读全文
posted @ 2012-08-31 21:05 YogyKwan 阅读(909) 评论(0) 推荐(1) 编辑
摘要: Numerically SpeakingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 163 Accepted Submission(s): 97 Problem DescriptionA developer of crossword puzzles (and other similar word games) has decided to develop a mapping between every possible word wit 阅读全文
posted @ 2012-08-31 18:29 YogyKwan 阅读(457) 评论(0) 推荐(1) 编辑
摘要: Watch The MovieTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 245 Accepted Submission(s): 116Problem DescriptionNew semester is coming, and DuoDuo has to go to school tomorrow. She decides to have fun tonight and will be very busy after tonight.. 阅读全文
posted @ 2012-08-31 03:20 YogyKwan 阅读(265) 评论(0) 推荐(1) 编辑
摘要: 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 209 Accepted Submission(s): 120Problem Description急!灾区的食物依然短缺! 为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大米都是袋装产品,其价格不等,并且只能整袋购买。 请问:你用有限的资金最多能采购多少公斤粮食呢?后记:. 阅读全文
posted @ 2012-08-31 03:10 YogyKwan 阅读(185) 评论(0) 推荐(1) 编辑
摘要: Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 215 Accepted Submission(s): 117Problem Description Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes. 阅读全文
posted @ 2012-08-31 03:07 YogyKwan 阅读(190) 评论(0) 推荐(1) 编辑
摘要: Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 226 Accepted Submission(s): 115Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such . 阅读全文
posted @ 2012-08-31 03:03 YogyKwan 阅读(424) 评论(0) 推荐(0) 编辑
上一页 1 ··· 5 6 7 8 9 10 11 12 下一页