geeksForGeeksSolutions/equalSumPartition.cpp at master · kk77777/geeksForGeeksSolutions · 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
56
57
58
#include <bits/stdc++.h>
using namespace std;
int t[105][100005];

bool isSubsetSum(int a[], int n, int sum)
{

    if (sum == 0)
        return true;

    if (n == 0 && sum != 0)
        return false;

    if (t[n][sum] != 0)
        return t[n][sum];

    if (a[n - 1] > sum)
        return isSubsetSum(a, n - 1, sum);

    else if (a[n - 1] <= sum)
    {
        return t[n][sum] = (isSubsetSum(a, n - 1, sum - a[n - 1])) || (isSubsetSum(a, n - 1, sum));
    }
}

int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int tc;
    cin >> tc;
    while (tc--)
    {

        memset(t, 0, sizeof t);

        int n;
        cin >> n;
        int a[n + 4];
        int sum = 0;
        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
            sum += a[i];
        }
        if (sum % 2 != 0)
        {
            cout << "NO\n";
        }
        else
        {
            isSubsetSum(a, n, sum / 2) ? cout << "YES\n" : cout << "NO\n";
        }
    }
}