摘要:Froghttp://acm.hdu.edu.cn/showproblem.php?pid=2182Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 670Accepted Submission(s): 318Problem DescriptionA little frog named Fog is on his way home. The path's length is N (1 = 1). The next line contain
阅读全文
摘要:动态规划 50题 题号hdu--http://acm.hdu.edu.cnpku--http://poj.org一hdu2182 Frog---------------------------------------------------∞已解决hdu2185 Chess ==pku2626hdu1114(pku1384) Piggy-Bank ----------------------------------∞已解决hdu3281 ballshdu1502 Regular Words二hdu1003 Max Sum p61---------------------------------
阅读全文
摘要:Happy 2004不知道怎么转载就复制过来了原地址是:http://www.cnblogs.com/372465774y/archive/2012/10/22/2733977.htmlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 673 Accepted Submission(s): 481Problem DescriptionConsider a positive integer X,and let S be the sum of al
阅读全文
摘要:Moving Tableshttp://acm.hdu.edu.cn/showproblem.php?pid=1050Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14896Accepted Submission(s): 5096Problem DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose s
阅读全文
摘要:Wooden Stickshttp://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1025Time Limit: 2 Seconds Memory Limit: 65536 KBThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It...
阅读全文
摘要:How Many Tableshttp://acm.hdu.edu.cn/showproblem.php?pid=1213Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9188Accepted Submission(s): 4510Problem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time.
阅读全文
摘要:小希的迷宫http://acm.hdu.edu.cn/showproblem.php?pid=1272Problem Description上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回头路)。小希现在把她的设计图给你,让你帮忙判断她的设计图是否符合她的设计思路。比如下面的例子,前两个是符合条件
阅读全文