-
Notifications
You must be signed in to change notification settings - Fork 4
/
subsetsum.cpp
49 lines (40 loc) · 1.01 KB
/
subsetsum.cpp
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
#include <iostream>
using namespace std;
// DP Solution.
// function to check if there is a subset of the given set with sum equal to given sum.
bool isSubsetSum(int set[], int n, int sum)
{
bool subset[n + 1][sum + 1];
for (int i = 0; i <= n; i++)
subset[i][0] = true;
for (int i = 1; i <= sum; i++)
subset[0][i] = false;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= sum; j++)
{
if (j < set[i - 1])
subset[i][j] = subset[i - 1][j];
if (j >= set[i - 1])
subset[i][j] = subset[i - 1][j]
|| subset[i - 1][j - set[i - 1]];
}
}
return subset[n][sum];
}
// Main code
int main()
{
int set[] = {1,5,3,7,4 };
int sum = 12;
int n = sizeof(set) / sizeof(set[0]);
if (isSubsetSum(set, n, sum) == true)
{
cout <<"Found a subset with given sum";
}
else
{
cout <<"No subset with given sum";
}
return 0;
}