Submission #5692216

---

Source Code Expand

#include<iostream>
#include<set>
#define REP(i,n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main(){
    int N ;
    cin >> N;
    int p[N];
    for(int i = 0 ; i  < N; i++){
        cin >> p[i];
    }

    set<ll> sets;
    sets.insert(0);
    REP(i, N){
        set<ll> tmpsets = sets;
        for(auto v: tmpsets){
            sets.insert(v + p[i]);
            //cout << v << endl;
        }
    }
    cout << sets.size() << endl;
    /*
    ll dp[N][N];
    set<ll> sets;
    REP(i,N){
        REP(j,N) dp[i][j] = 0;
    }
    REP(i,N) {
        dp[i][i] = p[i];
        sets.insert(p[i]);
    }
    for(int i = 1; i < N; i++){//これは差
        for(int j = 0; j < N - i; j++){//jは足し始めのかず
            dp[j][j+i] = dp[j][j+i-1] + dp[j+i][j+i];
            sets.insert(dp[j][j+i]);
        }
    }
    for(auto v: sets){
        cout << v << endl;
    }
    cout << sets.size() << endl;
    */
}

Submission Info

Judge Result