HDU ACM Steps 3.3.3 Ahui Writes Word || HDU 3732 Ahui Writes Word
#include
#include
#include
#defineMAXN15000
//典型的多重背包问题,用二进制方法进行物品数量的压缩
intmap[15][15];
//背包问题多数用一维就够了,除非有多个费用
intdp[MAXN];
intmain()
{
intn,c,i,j,x,y,k,t,sum;
chars[100];
while(scanf("%d%d",&n,&c)!=