贪心
hpugym
这个作者很懒,什么都没留下…
展开
-
hdu 1050 Moving Tables
Problem DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.The floor has 200 rooms each on the north side原创 2014-08-11 10:15:21 · 333 阅读 · 0 评论 -
hdu 4790 Killing Monsters
Killing MonstersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1570 Accepted Submission(s): 671Problem DescriptionKingdom原创 2014-12-09 14:32:47 · 408 阅读 · 0 评论 -
hdu 1092 The Dragon of Loowater
Problem DescriptionOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem. The shores of Rellau Creek in central Loowater had always been a prime breeding gro原创 2014-11-23 15:06:24 · 412 阅读 · 0 评论 -
nyoj 1057 寻找最大数(三)
描述给出一个整数N,每次可以移动2个相邻数位上的数字,最多移动K次,得到一个新的整数。求这个新的整数的最大值是多少。输入多组测试数据。每组测试数据占一行,每行有两个数N和K (1 ≤ N≤ 10^18; 0 ≤ K ≤ 100).输出每组测试数据的输出占一行,输出移动后得到的新的整数的最大值。样例输入1990 1100 09090000078原创 2014-11-20 21:39:15 · 557 阅读 · 0 评论 -
hdu Crixalis's Equipment
Problem DescriptionCrixalis - Sand King used to be a giant scorpion(蝎子) in the deserts of Kalimdor. Though he's a guardian of Lich King now, he keeps the living habit of a scorpion like living und原创 2014-08-19 15:11:21 · 511 阅读 · 0 评论 -
nyoj 814
Greedy Mouse时间限制:1000 ms | 内存限制:65535 KB难度:3描述A fat mouse prepared M pounds of cat food,ready to trade with the cats guarding the warehouse containing hisfavorite food:peanut原创 2014-09-22 18:59:30 · 487 阅读 · 0 评论 -
nyoj 过河问题
过河问题时间限制:1000 ms | 内存限制:65535 KB难度:5描述在漆黑的夜里,N位旅行者来到了一座狭窄而且没有护栏的桥边。如果不借助手电筒的话,大家是无论如何也不敢过桥去的。不幸的是,N个人一共只带了一只手电筒,而桥窄得只够让两个人同时过。如果各自单独过桥的话,N人所需要的时间已知;而如果两人同时过桥,所需要的时间就是走得比较慢的那个人单独行动时所需的时间。问题是,原创 2014-08-12 19:48:05 · 495 阅读 · 0 评论 -
hdu 1045 Fire Net
Problem DescriptionSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.A blockh原创 2014-08-12 15:19:37 · 383 阅读 · 0 评论 -
hdu 最少拦截系统
某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求救了,请帮助计算一下最少需要多少套拦截系统原创 2014-08-11 11:28:29 · 415 阅读 · 0 评论 -
hdu 1052 田忌赛马
Problem DescriptionHere is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king an原创 2014-08-11 19:33:22 · 387 阅读 · 0 评论 -
nyoj 218 dinner
Dinner时间限制:100 ms | 内存限制:65535 KB难度:1描述Little A is one member of ACM team. He had just won the gold in World Final. To celebrate, he decided to invite all to have one meal. As bowl,原创 2014-09-19 21:20:21 · 462 阅读 · 0 评论 -
hdu 5135 Little Zu Chongzhi's Triangles 贪心
Little Zu Chongzhi's Triangles Time Limit : 2000/1000ms (Java/Other) Memory Limit : 512000/512000K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 3Problem DescriptionZu Chong原创 2015-08-15 12:05:55 · 511 阅读 · 1 评论