DSA_cpp/recursion/lec14_perfectsum.cpp at main · Jashans254/DSA_cpp · 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
https://www.geeksforgeeks.org/problems/perfect-sum-problem5633/1?utm_source=geeksforgeeks&utm_medium=ml_article_practice_tab&utm_campaign=article_practice_tab

//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;

// } Driver Code Ends
class Solution{


int countSubsets(int arr[], int index, int n, int target) {
    // Base cases

    if (index == n) {
       return target == 0 ;
    }

    long long ans=countSubsets(arr, index + 1, n, target);
    ans+= countSubsets(arr, index + 1, n, target - arr[index]);
    return ans%1000000007;
}
	public:
	int perfectSum(int arr[], int n, int sum)
	{
         return countSubsets(arr,  0,  n,  sum);
	}

};

//{ Driver Code Starts.
int main()
{


   	int t;
    cin >> t;
    while (t--)
    {
        int n, sum;

        cin >> n >> sum;

        int a[n];
        for(int i = 0; i < n; i++)
        	cin >> a[i];


	    Solution ob;
	    cout << ob.perfectSum(a, n, sum) << "\n";

    }
    return 0;
}

// } Driver Code Ends