POJ 1837 Balance（DP）

题意：现在有一个天平，有n个刻度处有挂钩，另有m个砝码，计算出能使得天平平衡的方案数，每个砝码必须用到，每个挂钩不一定要用到。

思路：DP。用dp[i][j]表示放置前i个砝码后天平左右两侧的差值为j的方案数，然后递推即可。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;

//const int MAXN = 5000000 + 5;
//const int INF = 0x3f3f3f3f;
const int BASE = 5000;
int n, m;
int dp[25][10000], c[30], g[30];
int main() {
    //freopen("input.txt", "r", stdin);
	while(scanf("%d%d", &n, &m) == 2) {
		memset(dp, 0, sizeof(dp));
		for(int i = 1; i <= n; i++) scanf("%d", &c[i]);
		for(int i = 1; i <= m; i++) scanf("%d", &g[i]);
		dp[0][BASE] = 1;
		for(int i = 1; i <= m; i++) {
			for(int j = 1; j <= n; j++) {
				for(int k = 0; k <= 10000; k++)
					if(g[i]*c[j]+k>=0 && g[i]*c[j]+k<=10000) dp[i][k+g[i]*c[j]] += dp[i-1][k];
			}
		}
		cout << dp[m][BASE] << endl;
	}
    return 0;
}