Submission #97409

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
int main()
{
	int n;
	bool dp[101][10010];
	int a[100];
	cin >> n;
	for(int i=0;i<n;i++)
	{
		cin >> a[i];
	}
	dp[0][0]=true;
	for(int i=0;i<=n;i++)
	{
		for(int j=0;j<=10010;j++)
		{
			if(j<a[i])dp[i+1][j]=dp[i][j];
			else 
			{
				dp[i+1][j]=dp[i][j];
				dp[i+1][j]=dp[i][j-a[i]];
			}
		}
	}
	int ans=0;
	for(int i=0;i<10010;i++)
	{
		if(dp[n][i])ans++;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result