摘要: Climbing WormTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10022Accepted Submission(s): 6603Problem DescriptionAn inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minu 阅读全文
posted @ 2013-07-26 20:34 hpuacm周宏伟 阅读(111) 评论(0) 推荐(0) 编辑
摘要: Keep on Truckin'Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6805Accepted Submission(s): 4694Problem DescriptionBoudreaux and Thibodeaux are on the road again . . ."Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by to 阅读全文
posted @ 2013-07-26 19:19 hpuacm周宏伟 阅读(327) 评论(0) 推荐(0) 编辑
摘要: Fibonacci AgainTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29168Accepted Submission(s): 14126Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence 阅读全文
posted @ 2013-07-26 17:27 hpuacm周宏伟 阅读(311) 评论(0) 推荐(0) 编辑
摘要: ElevatorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33731Accepted Submission(s): 18412Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floo 阅读全文
posted @ 2013-07-26 16:34 hpuacm周宏伟 阅读(202) 评论(0) 推荐(0) 编辑
摘要: 平方和与立方和Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 69803Accepted Submission(s): 21711Problem Description给定一段连续的整数,求出他们中所有偶数的平方和以及所有奇数的立方和。Input输入数据包含多组测试实例,每组测试实例包含一行,由两个整数m和n组成。Output对于每组输入数据,输出一行,应包括两个整数x和y,分别表示该段连续的整数中所有偶数的平方和以及所有奇数的立方和。你可以认 阅读全文
posted @ 2013-07-26 16:07 hpuacm周宏伟 阅读(152) 评论(0) 推荐(0) 编辑
摘要: 成绩转换Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 57290Accepted Submission(s): 24934Problem Description输入一个百分制的成绩t,将其转换成对应的等级,具体转换规则如下:90~100为A;80~89为B;70~79为C;60~69为D;0~59为E;Input输入数据有多组,每组占一行,由一个整数组成。Output对于每组输入数据,输出一行。如果输入数据不在0~100范围内,请输出一行:“ 阅读全文
posted @ 2013-07-26 15:56 hpuacm周宏伟 阅读(187) 评论(0) 推荐(0) 编辑
摘要: A+B for Input-Output Practice (I)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62475Accepted Submission(s): 35141Problem DescriptionYour task is to Calculate a + b.Too easy?! Of course! I specially designed the problem for acm beginners. You must 阅读全文
posted @ 2013-07-26 15:05 hpuacm周宏伟 阅读(659) 评论(0) 推荐(0) 编辑