猿的进化

Herbs Gathering Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 548    Accepted Submission(s): 104 Problem Description Collecting o

L - FATE Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description 最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这

zhx and contest Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 731    Accepted Submission(s): 271 Problem Description As one of th

B - ACboy needs your help Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description ACboy has N courses this term, and he plans to spend at m

D - Cash Machine Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u Submit Status Practice POJ 1276 Description A Bank plans to install a machine for cash

A - Bone Collector II Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description The title of this problem is familiar,isn't it?yeah,if you

多重背包转化成01背包； 怎么转化 ？？，每个物品有k件，k可以写成1,2,4,8，，，的和的形式，以这些2的几次幂的数可以组合得到 1-k每个数，这样将一个物品化成多个物品，然后每个  物品取与不取，变成01背包； 我们试试看，比如Ci  = 14，我们可以把它化成如下4个物品： 重量是Wi，体积是Vi 重量是2 * Wi , 体积是2 * Vi 重量是4 * Wi ,

http://acm.hdu.edu.cn/showproblem.php?pid=1114 加礼#——买六个月送域名代金券！ Piggy-Bank Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submi