BETA

Difficulty Level: Hard

Submissions: 696 Accuracy:

14.94%

Partition array to K subsets (Function Problem)
       

Given an integer array A[] of N elements, the task is to complete the function which returns true if the array A[] could be divided into K non-empty subsets such that the sum of elements in every subset is same.

Note: All elements of this array should be part of exactly one partition.

Examples:
Input : A[] = [2, 1, 4, 5, 6], K = 3
Output : 1, as we can divide above array into 3 parts with equal sum as (2, 4), (1, 5), (6)

 

Input : A[] = [2, 1, 5, 5, 6], K = 3
Output : 0, as it is not possible to divide above array into 3 parts with equal sum


Input:
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains 3 lines. The first line of each test case contains an integer denoting the size of the array. In the next line are N space separated values of the array A[ ]. In the next line is an integer K.

Output:
The output for each test case will be 1 if the array could be divided into k subsets else 0 .

Constraints:
1<=T<=100
1<=N,K<=100
1<=A[ ] <=100

Example(To be used only for expected output):
Input:

2
5
2 1 4 5 6
3
5
2 1 5 5 6
3
Output:
1
0

 

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Amit Khandelwal


					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.