algorithms/main72.cpp at master · rishabhs95/algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <iostream>
#include <cstring> //memset
#include <algorithm>
#include <bitset>
#include <string>
#include <vector>
#include <utility>
#include <cstdio>
#include <queue>
#include <cmath>
#include <list>
#include <set>
#include <map>

using namespace std;
int A[110], len;
bool dp[1010][110];

bool sub (int sum) {
	for (int i = 0; i <= len; i++)
			dp[0][i] = true;
	for (int i = 1; i <= sum; i++)
			dp[i][0] = false;
	for (int i = 0; i <= sum; i++) {
		for (int j = 0; j <= len; j++) {
			dp[i][j] = dp[i][j-1];
			if (A[j-1] <= i)
				dp[i][j] = dp[i][j] | dp[i-A[j-1]][j-1];
		}
	}
	for (int i = 0; i <= sum; i++) {
		for (int j = 0; j <= len; j++)
			cout << dp[i][j] << " ";
		cout << endl;
	}
	cout << endl;
	return dp[sum][len];
}

int main() {
	freopen("input.txt", "r", stdin);
	int test_cases, sum;
	cin >> test_cases;
	while (test_cases--) {
		sum = 0;
		cin >> len;
		for (int i = 0; i < len; i++)
			cin >> A[i];
		for (int i = 0; i < len; i++)
			if (sub(A[i]))
				sum += A[i];
		cout << sum << endl;
	}
	return 0;
}