关闭

HDU 1719 Friend

Problem Description Friend number are defined recursively as follows.  (1) numbers 1 and 2 are friend number;  (2) if a and b are friend numbers, so is ab+a+b;  (3) only the numbers defined in (1)...
阅读(15) 评论(0)

HDU 3763 CD(二分查找)

Problem Description Jack and Jill have decided to sell some of their Compact Discs, while they still have some value. They have decided to sell one of each of the CD titles that they both own. How ma...
阅读(45) 评论(0)

HDU 1727 Hastiness

Problem Description How many problems did you AC?  When you read this problem, don’t hasty and careless, this is also simple, haha, I didn’t cheat you.  The game over soon, WisKey starts using Engl...
阅读(14) 评论(0)

HDU 1114 Piggy-Bank

Problem Description Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The ...
阅读(14) 评论(0)

HDU 4501 小明系列故事——买年货(二维背包变形)

Problem Description   春节将至,小明要去超市购置年货,于是小明去了自己经常去的都尚超市。    刚到超市,小明就发现超市门口聚集一堆人。用白云女士的话说就是:“那家伙,那场面,真是人山人海,锣鼓喧天,鞭炮齐呤,红旗招展。那可真是相当的壮观啊!”。好奇的小明走过去,奋力挤过人群,发现超市门口贴了一张通知,内容如下:        值此新春佳节来临之际,为了回馈广大顾客的...
阅读(19) 评论(0)

HDU 2191 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活

Problem Description 急!灾区的食物依然短缺!  为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大米都是袋装产品,其价格不等,并且只能整袋购买。  请问:你用有限的资金最多能采购多少公斤粮食呢? 后记:  人生是一个充满了变数的生命过程,天灾、人祸、病痛是我们生命历程中不可预知的威胁。  月有阴晴...
阅读(20) 评论(0)

HDU 1702 ACboy needs your help again!

Problem Description ACboy was kidnapped!!  he miss his mother very much and is very scare now.You can’t image how dark the room he was put into is, so poor :(.  As a smart ACMer, you want to get AC...
阅读(9) 评论(0)

HDU 1035 Robot Motion

Problem Description   A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions...
阅读(12) 评论(0)

HDU 2844 Coins(多重背包)

Problem Description Whuacmers use coins.They have coins of value A1,A2,A3…An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a ne...
阅读(19) 评论(0)

HDU 3535 AreYouBusy(分组背包)

Problem Description Happy New Term!  As having become a junior, xiaoA recognizes that there is not much time for her to AC problems, because there are some other things for her to do, which makes he...
阅读(15) 评论(0)

HDU 2159 FATE(二维费用)

Problem Description 最近xhd正在玩一款叫做FATE的游戏,为了得到极品装备,xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感,但又不得不通过杀怪来升完这最后一级。现在的问题是,xhd升掉最后一级还需n的经验值,xhd还留有m的忍耐度,每杀一个怪xhd会得到相应的经验,并减掉相应的忍耐度。当忍耐度降到0或者0以下时,xhd就不会玩这游戏。xhd还说了他最多只杀s...
阅读(18) 评论(0)

HDU 2602 Bone Collector

Problem Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave ...
阅读(16) 评论(0)

HDU 1171 Big Event in HDU

Problem Description Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don’t know that Computer College had ever been split into Computer College and Softwar...
阅读(48) 评论(0)

HDU 1120 Constructing Roads

Problem Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connec...
阅读(59) 评论(0)

最小树形图(朱-刘算法)

定义:一个有向图,存在从某个点开始的到达所有的的一个最小生成树,则它就是最小树形图。 从早晨到现在一直在翻资料,终于理解了一点。朱-刘算法的大概过程如下: 1、找到除了root以为其他点的权值最小的入边。用In[i]记录 2、如果出现除了root以为存在其他孤立的点,则不存在最小树形图。 3、找到图中所有的环,并对环进行缩点,重新编号。4、更新其他点到环上的点的距离,如: 环中的点有(Vk1,Vk2...
阅读(47) 评论(0)
139条 共10页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:11096次
    • 积分:1325
    • 等级:
    • 排名:千里之外
    • 原创:116篇
    • 转载:23篇
    • 译文:0篇
    • 评论:0条