# HDU 1114 （dp 完全背包）

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 <= E <= F <= 10000. On the second line of each test case, there is an integer number N (1 <= N <= 500) that gives the
number of various coins used in the given currency. Following this are exactly N lines, each specifying one coin type. These lines contain two integers each, Pand W (1 <= P <= 50000, 1 <= W <=10000). P is the value of the coin in monetary units, W is it‘s
weight in grams.

Output

Print exactly one line of output for each test case. The line must contain the sentence "The minimum amount of money in the piggy-bank is X." where X is the minimum amount of money that can be achieved using coins with the given
total weight. If the weight cannot be reached exactly, print a line "This is impossible.".

Sample Input

3

10 110

2

1 1

30 50

10 110

2

1 1

50 30

1 6

2

10 3

20 4

Sample Output

The minimum amount of money in the piggy-bank is 60.

The minimum amount of money in the piggy-bank is 100.

This is impossible.

```#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define MAXN 10005
#define INF 10000000
using namespace std;

int cas;
int dp[MAXN];
int Empty_Weight, Total_Weight, Rest_Weight;
int Coin_Value, Coin_Weight, Coin_Type;

int Min(int x, int y) { return x < y ? x : y; }

int main()
{
scanf("%d", &cas);
while(cas--) {
scanf("%d %d %d", &Empty_Weight, &Total_Weight, &Coin_Type);
for(int i=0; i<MAXN; i++) dp[i] = INF;
dp = 0;
Rest_Weight = Total_Weight - Empty_Weight;
for(int i=0; i<Coin_Type; i++) {
scanf("%d %d", &Coin_Value, &Coin_Weight);
for(int j=Coin_Weight; j<=Rest_Weight; j++) {
dp[j] = Min(dp[j], dp[j-Coin_Weight]+Coin_Value);
}
}
if(dp[Rest_Weight] < INF) printf("The minimum amount of money in the piggy-bank is %d.\n", dp[Rest_Weight]);
else puts("This is impossible.");
}
return 0;
}
```

## HDU 1114 Piggy-Bank 全然背包

Piggy-Bank Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action come

## hdu 1171 Big Event in HDU（dp 01背包 母函数）

01背包 #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<iostream> using namespace std; int v,m; int dp; int main() { int n; int i,j,k; while(scanf("%d",&n)!=EOF) {

## hdu 5312 dp（背包）、二分图或其他姿势 ## hdu 1561The more, The Better（树形dp&amp;01背包）

The more, The Better Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4949    Accepted Submission(s): 2918 Problem Description ACboy很喜欢玩一种战略游戏,在一个地图上,有N座城堡,每座城堡都有一定的宝物,在每次游戏中ACboy允许攻克M个城堡并获得里面的宝

## HDU 2955 Robberies --01背包变形 