Submission #6327815

---

Source Code Expand

#include <bits/stdc++.h>
using  namespace  std;
using ll=long long;
const int mod =1e9+7;
int dp[10010];
int main(){
  int n;
  cin>>n;
  vector<int> a(n);
  for(int i=0;i<n;i++)cin>>a.at(i);
  memset(dp,0,sizeof(dp));
  dp[0]=1;
  for(int i=0;i<n;i++){
     for(int j=10000;j>=0;j--){
       if(j>=a.at(i)&&dp[j-a.at(i)]==1)dp[j]=1;
         }
       }
       int ans=0;
     for(int j=0;j<=10000;j++){
       ans+=dp[j];
         }
         cout<<ans<<endl;
}

Submission Info

Judge Result