Submission #6408076

---

Source Code Expand

#include "bits/stdc++.h"

using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
bool dp[101][10001];
int p[100];
int main() {
	int N;
	cin >> N;
	for (int i = 0; i < N; i++) cin >> p[i];
	dp[0][0] = 1;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= i * 100; j++) {
			dp[i + 1][j] |= dp[i][j];
			dp[i + 1][j + p[i]] |= dp[i][j];
		}
	}
	int ans = 0;
	for (int i = 0; i <= N * 100; i++) if (dp[N][i]) ans++;
	cout << ans << endl;
}

Submission Info

Judge Result