poj 1837

#include <iostream>
#include <string>
#include <stdio.h>
#include <string.h>
using namespace std;
// if you can think of the state as distance*weight, then the problem is easy
// dp[i][j] dedicates the num of the first i's weight of state j
// the state can be [-20*25*15, 20*25*15]
// so we can use the array dp[20+1][20*25*15*2+1] to represent the states;
// and when the state is 7500, the balance is ok
int dp[21][7500*2+1];
int dis[21];
int weight[21];
int c,g;
int main(){
    scanf("%d %d",&c,&g);
    for (int i = 1; i <= c; ++i) {
        scanf("%d", dis+i);
    }
    for (int i = 1; i <=g; ++i) {
        scanf("%d", weight+i);
    }
    memset(dp, 0, sizeof(dp));
    dp[0][7500] = 1;
    for (int i = 1; i <=g; ++i) {
        for (int j = 0; j <= 7500*2 ; ++j) {
            for (int k = 1; k <= c; ++k) {
                dp[i][j+weight[i]*dis[k]] += dp[i-1][j];
            }
        }
    }
    cout<<dp[g][7500]<<endl;
}