Submission #6416557

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000009
#define INF 1<<30

int dp[105][10005];

int main() {
    int n;
    cin >> n;
    int p[100];
    int sum;
    for (int i = 0; i < n; i++) {
        cin >> p[i];
        sum += p[i];
    }


    dp[0][0] = 1;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= sum; j++) {
            dp[i+1][j] += dp[i][j];
            if (j >= p[i]) {
                dp[i+1][j] += dp[i][j-p[i]]+1;
            }
        }
    }

    cout << dp[n][sum] << endl;
    return 0;
}

Submission Info

Judge Result