杭电ACM题1114.把并代码写一下给我,最好再写一下解决的方法说明.我懒得写.貌似挺简单的,帮个忙,谢了

杭电ACM题1114.把并代码写一下给我,最好再写一下解决的方法说明.我懒得写.貌似挺简单的,帮个忙,谢了
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 idea behind is simple. Whenever some ACM member has any small money, he takes all the coins and throws them into a piggy-bank. You know that this process is irreversible, the coins cannot be removed without breaking the pig. After a sufficiently long time, there should be enough cash in the piggy-bank to pay everything that needs to be paid.
But there is a big problem with piggy-banks. It is not possible to determine how much money is inside. So we might break the pig into pieces only to find out that there is not enough money. Clearly, we want to avoid this unpleasant situation. The only possibility is to weigh the piggy-bank and try to guess how many coins are inside. Assume that we are able to determine the weight of the pig exactly and that we know the weights of all coins of a given currency. Then there is some minimum amount of money in the piggy-bank that we can guarantee. Your task is to find out this worst case and determine the minimum amount of cash inside the piggy-bank. We need your help. No more prematurely broken pigs!

Input
The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing two integers E and F. They indicate the weight of an empty pig and of the pig filled with coins. Both weights are given in grams. No pig will weigh more than 10 kg, that means 1

这是个简单的背包DP哦,建议你先去找那本《计算机算法设计与分析》的动态规划部分看看哦,看完0-1背包再看完全背包,这是个完全背包问题.
关于这个转移方程,书上有类似的解释,篇幅挺长的,这里就不写了