Submission #1453729

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <climits>
using namespace std;

void dp(int sum, vector<int>::iterator itr, vector<int>& p, set<int>& s)
{
    if (p.end() == itr)
        s.insert(sum);
    else {
        // 2 pattern: with or without *itr
        dp(sum + *itr, itr + 1, p, s);
        dp(sum, itr + 1, p, s);
    }
}

int main()
{
    int i, n;
    cin >> n;
    vector<int> p;
    set<int> s;
    for (i = 0; i < n; i++) {
        int pi;
        cin >> pi;
        p.push_back(pi);
    }
    dp(0, p.begin(), p, s);
    cout << s.size() << endl;
    return 0;
}

Submission Info

Judge Result