Submission #5656764

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <unordered_set>


using namespace std;


int main()
{
    int N;
    cin>>N;
    vector<int> score;
    for(int i=0; i<N; i++){
        int p;
        cin>>p;
        score.push_back(p);
    }


    unordered_set<int> us[101];
    us[0].emplace(0);
    for(int i=1; i<=N; i++){
        unordered_set<int> tmp = us[i-1];

        for(auto& num : tmp){
            tmp.emplace(num+score[i-1]);
        }
        tmp.emplace(score[i-1]);

        us[i] = tmp;
    }

    cout<<us[N].size()<<endl;

    return 0;
}

Submission Info

Judge Result