Submission #5497604

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>

using namespace std;

int dp[101][100010];

int main()
{
    int n;
    int a[10010];
    int ans = 0;
    bool num[100010] = {};

    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    dp[0][0] = 1;

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

    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= 10000; j++) {
            if (dp[i][j]  && num[j] == 0) {
                ans++;
                num[j] = 1;
            }
        }
    }

    cout << ans << endl;
}

Submission Info

Judge Result