摘要：
水平稀，只能做A，B，CA. Whose sentence is it?time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day, liouzhou_101 got a chat record of Freda and Rainbow. ... 阅读全文
摘要：
因为没有刻度，所以X->Y只有两种情况：1：X倒完了2：Y倒满了非常可乐Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3112Accepted Submission(s): 1273Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个 阅读全文
摘要：
错排数 D（n）=（D( n-1)+D( n-2)）×（n-1）不容易系列之一Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11260Accepted Submission(s): 4683Problem Description大家常常感慨，要做好一件事情真的不容易，确实，失败比成功容易多了！做好“一件”事情尚且不易，若想永远成功而总从不失败，那更是难上加难了，就像花钱总是比挣钱容易的道理一样。话虽这样说，我还是要告诉大家，要想失败 阅读全文
摘要：
钱币兑换问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3901Accepted Submission(s): 2203Problem Description在一个国家仅有1分，2分，3分硬币，将钱N兑换成硬币有很多种兑法。请你编程序计算出共有多少种兑法。Input每行只有一个正整数N，N小于32768。Output对应每个输入，输出兑换方法数。Sample Input293412553Sample Output71883113137761 阅读全文
摘要：
Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7570Accepted Submission(s): 3783Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes f 阅读全文
摘要：
前m大的数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7048Accepted Submission(s): 2508Problem Description还记得Gardon给小希布置的那个作业么？（上次比赛的1005）其实小希已经找回了原来的那张数表，现在她想确认一下她的答案是否正确，但是整个的答案是很庞大的表，小希只想让你把答案中最大的M个数告诉她就可以了。给定一个包含N(N<=3000)个正整数的序列，每个数不超过5000，对它 阅读全文
摘要：
排名Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12399Accepted Submission(s): 4616Problem Description今天的上机考试虽然有实时的Ranklist，但上面的排名只是根据完成的题数排序，没有考虑每题的分值，所以并不是最后的排名。给定录取分数线，请你写程序找出最后通过分数线的考生，并将他们的成绩按降序打印。Input测试输入包含若干场考试的信息。每场考试信息的第1行给出考生人数N ( 0 < 阅读全文
摘要：
1：每一组X,Y,Z对应3个立方体2：按面积从小到大DPMonkey and BananaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5356Accepted Submission(s): 2744Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana a 阅读全文
摘要：
d( i )=d( j ）『符合条件的0～i-1之间的最大的』+a[ i ]Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16601Accepted Submission(s): 7066Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is ve 阅读全文
摘要：
排序函数很坑爹。ClockTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3411Accepted Submission(s): 1048Problem DescriptionThere is an analog clock with two hands: an hour hand and a minute hand. The two hands form an angle. The angle is measured as the small 阅读全文