Given an array of integers the task is to find maximum size of a subset such that sum of each pair of this subset is not divisible by K.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains an integer N denoting the size of an array and the number k. The second line of each test case contains N space separated integers denoting elements of the array A[ ].
For each test case in a new line print the answer to each testcase.
1<= T <=100
1<= N, K <=10000
1<= A <=1000000
3 7 2 9 1
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.