2021-04-07

原题链接
DP做法

#include <iostream>
#include <cstring>

using namespace std;

const int N = 1010, p = 4000, M = 10010;

typedef long long LL;

LL f[5][M], w[5][N], n, m;

int main() {
    cin >> n;
    for (int i = 1; i <= 4; i ++) {
        for (int j = 1; j <= n; j ++)
            cin >> w[i][j], w[i][j] += 1000;    //增加偏移量
    }
    cin >> m;
    m += 4000;      //增加偏移量
    for (int i = 1; i <= n; i ++)
        f[1][w[1][i]] ++;
    for (int i = 2; i <= 4; i ++)
        for (int k = 0; k <= m; k ++)   //枚举价值
            for (int j = 1; j <= n; j ++)
             {
                int t = k - w[i][j];
                if (t >= 0 && f[i - 1][t])   f[i][k] += f[i - 1][t];
            }
    cout << f[4][m] << endl;

    return 0;
}