Submission #1774764

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int main() {
    int n, d, x;
    cin >> n >> d >> x;
    vector<vector<int>> p(d, vector<int>(n));
    for (int i = 0; i < d; ++i) {
        for (int j = 0; j < n; ++j)
            cin >> p[i][j];

        if (i) {
            vector<int> dp(100010);
            for (int j = 0; j < 100010; ++j)
                dp[j] = j;
            for (int j = 0; j < n; ++j)
                for (int k = p[i - 1][j]; k < 100010; ++k)
                    dp[k] = max(dp[k], dp[k - p[i - 1][j]] + p[i][j]);

            x = dp[x];
        }
    }
    cout << x << "\n";
    return 0;
}

Submission Info

Judge Result