Submission #1232535

---

Source Code Expand

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
using namespace std;

long long M=1000000007;
int main(int argc, char const *argv[]) {
  int n;cin>>n;
  vector<int> a(n);
  for(int i=0;i<n;++i)cin>>a[i];
  int N=11000;
  vector<bool> dp(N);
  dp[0]=1;
  for(int i=0;i<n;++i){
    for(int j=N-1;j>-1;--j){
      if(j-a[i]>-1&&dp[j-a[i]])dp[j]=1;
    }
  }
  int res=0;
  for(bool b:dp)res+=b;
  cout<<res<<endl;
  return 0;
}

Submission Info

Judge Result