Submission #97316

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <queue>
#include <bitset>
#include <string>
using namespace std;

#define REP(i,n) for(int i=0; i<n; i++)
#define RPA(i,s,e) for(int i=s; i<=e; i++)
#define RPD(i,s,e) for(int i=s; i>=e; i--)
#define PB(a) push_back(a)
#define MP(i,s) make_pair(i,s)
#define SZ(a) (int)(a).size()
#define ALL(a) (a).begin(), (a).end()
#define PRT(a) cerr << #a << " = " << (a) << endl
#define PRT2(a,b) cerr << #a << " = " << (a) << ", " << #b << " = " << (b) << endl
#define PRT3(a,b,c) cerr << (a) << ", " << (b) << ", " << (c) << endl

typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> P;

int n;
int a[101];
bool dp[101][12000];

void solve() {
	memset(dp, 0, sizeof(dp));
	dp[0][0] = true;
	for(int i=1; i<=n; i++) {
		dp[i][0] = true;
		for(int p=0; p<12000; p++) {
			if(dp[i-1][p]) {
				dp[i][p] = true;
				dp[i][p+a[i-1]] = true;
			}
		}
	}

	int cnt = 0;
	for(int p=0; p<12000; p++) {
		if(dp[n][p]) {
			cnt++;
		}
	}
	printf("%d\n", cnt);
}

void coding() {
	while(cin>>n) {
		for(int i=0; i<n; i++) {
			cin >> a[i];
		}
		solve();
	}
}

// #define _LOCAL_TEST

int main() {
#ifdef _LOCAL_TEST
	clock_t startTime = clock();
	freopen("a.in", "r", stdin);
#endif

	coding();

#ifdef _LOCAL_TEST
	clock_t elapsedTime = clock() - startTime;
	cout << endl;
	cout << (elapsedTime / 1000.0) << " sec elapsed." << endl;
	cout << "This is local test" << endl;
	cout << "Do not forget to comment out _LOCAL_TEST" << endl << endl;
#endif
}

Submission Info

Judge Result