Leetcode-Solutions-1/count subset sum.cpp at master · rs1820/Leetcode-Solutions-1 · 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
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int subsetsum(int ar[],int n,long sum)
{

			int  dp[n+1][sum+1];
			int i,j;
			for(i=1;i<sum+1;i++)
			{
				dp[0][i]=false;
			}
			for(i=0;i<n+1;i++)
			{
				dp[i][0]=true;
			}
			dp[0][0]=true;
			for(i=1;i<=n;i++)
			{
				for(j=1;j<=sum;j++)
				{
					if(ar[i-1]<=j)
					{
						dp[i][j]=dp[i-1][j-ar[i-1]]+dp[i-1][j];
					}
					else
					{
						dp[i][j]=dp[i-1][j];
					}

				}

			}
			return dp[n][sum];


}


int main()
{
	int t;
	cin>>t;
	while(t--)
	{
			int n,sum;
			cin>>n>>sum;
			int ar[n];
			long  i,j;
			for(i=0;i<n;i++)
			{
				cin>>ar[i];
			}
			int res=subsetsum(ar,n,sum);
			cout<<res;
			cout<<endl;
	}
	return 0;
}