POJ 1837

Gigel has a strange “balance” and he wants to poise it. Actually, the device is different from any other ordinary balance.
It orders two arms of negligible weight and each arm’s length is 15. Some hooks are attached to these arms and Gigel wants to hang up some weights from his collection of G weights (1 <= G <= 20) knowing that these weights have distinct values in the range 1..25. Gigel may droop any weight of any hook but he is forced to use all the weights.
Finally, Gigel managed to balance the device using the experience he gained at the National Olympiad in Informatics. Now he would like to know in how many ways the device can be balanced.

Knowing the repartition of the hooks and the set of the weights write a program that calculates the number of possibilities to balance the device.
It is guaranteed that will exist at least one solution for each test case at the evaluation.
Input
The input has the following structure:
• the first line contains the number C (2 <= C <= 20) and the number G (2 <= G <= 20);
• the next line contains C integer numbers (these numbers are also distinct and sorted in ascending order) in the range -15..15 representing the repartition of the hooks; each number represents the position relative to the center of the balance on the X axis (when no weights are attached the device is balanced and lined up to the X axis; the absolute value of the distances represents the distance between the hook and the balance center and the sign of the numbers determines the arm of the balance to which the hook is attached: ‘-’ for the left arm and ‘+’ for the right arm);
• on the next line there are G natural, distinct and sorted in ascending order numbers in the range 1..25 representing the weights’ values.
Output
The output contains the number M representing the number of possibilities to poise the balance.

Sample Input

2 4
-2 3
3 4 5 8

Sample Output

2

题目大意：
有一个装置（天平）上有一些挂钩，给你一些砝码，问有多少种方法能使天平平衡。
平衡： 动力 * 动力臂 == 助力 * 阻力臂
如果把平衡状态设为0， 那么会出现负数，不大好处理。最大值为20*20*15*25 = 150000， 那么中点75000即为平衡点。
dp[i][j]:前i个砝码在j点是平衡的方法数

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;#define maxn 15000#define INF 0x3f3f3f3fint dp[21][maxn], way[maxn], weight[maxn];int main(){    int C, G, i, j, k;    while(~scanf("%d %d", &C, &G)){        for(i = 1; i <= C; ++i){            scanf("%d",&way[i]);        }        for(j = 1; j <= G; ++j){            scanf("%d",&weight[j]);        }        memset(dp, 0, sizeof(dp));        dp[0][7500] = 1;        for(i = 1; i <= G; ++i){            for(j = 0; j <= maxn; ++j){                if(dp[i-1][j]){                    for(k = 1; k <= C; ++k)                        dp[i][j+(way[k]*weight[i])] += dp[i-1][j];                }            }        }        printf("%d\n",dp[G][7500]);    }}