Submission #1443956

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define LL long long

using namespace std;

int main(){

    int N;
    cin>>N;
    int p[N];
    REP(i,N)cin>>p[i];

    bool dp[10001];
    fill_n(dp,10001,false);
    dp[0]=true;

    REP(i,N){
        for (int j=10000;j>=0;j--){
            if(dp[j])
                dp[j+p[i]]=true;
        }
    }
    int ans=0;
    REP(i,10001){
        if(dp[i])ans++;
    }
    cout<<ans<<endl;


    return 0;
}

Submission Info

Judge Result