DynamicProgramming/SubsetSumProblem.cpp at main · manishk-99/DynamicProgramming · 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
59
60
61
62
63
64
65
66
67
68
69
70
71
#include<bits/stdc++.h>
using namespace std;

int main() {
  int n = 6;
  int sum = 9;
  int set[n] = {3, 34, 4, 12, 5, 2};
  bool dp[n+1][sum+1];
  for(int i=0;i<n+1;i++)
  {
      for(int j=0;j<sum+1;j++)
      {
          if(i==0)
          {
              dp[i][j] = false;
          }
          if(j==0)
          {
              dp[i][j] = true;
          }
      }
  }

  for(int i=1;i<n+1;i++)
  {
      for(int j=1;j<sum+1;j++)
      {
          if(set[i-1]<= j)
          {
              dp[i][j] = dp[i-1][j-set[i-1]] || dp[i-1][j];
          } else {
              dp[i][j] = dp[i-1][j];
          }
      }
  }
  if(dp[n][sum] == true)
  {
      cout<<"Yes, It Exists"<<endl;
  } else
  {
      cout<<"No, It doesn't exists"<<endl;
  }
}


// //during Initialization
// 1 0 0 0 0 0 0 0 0 0
// 1 0 0 0 0 0 0 0 0 0
// 1 0 0 0 0 0 0 0 0 0
// 1 0 0 0 0 0 0 0 0 0
// 1 0 0 0 0 0 0 0 0 0
// 1 0 0 0 0 0 0 0 0 0
// 1 0 0 0 0 0 0 0 0 0

// //answer
// Yes, Subset exists

// //during output
// 1 0 0 0 0 0 0 0 0 0
// 1 0 0 1 1 1 1 1 0 0
// 1 0 0 1 1 1 1 1 0 0
// 1 0 0 1 1 1 1 1 1 1
// 1 0 0 1 1 1 1 1 1 1
// 1 0 0 1 1 1 1 1 1 1
// 1 0 0 1 1 1 1 1 1 1