Given an array of integers and a number k, write a function that returns true if given array can be divided into pairs such that sum of every pair is divisible by k.
Input:
The first line of input contains an integer T denoting the number of test cases. The T test cases follow. Each test case contains an integer n denoting the size of the array. The next line contains the n space separated integers forming the array. The last line contains the value of k.
Output:
Print "True" (without quotes) if given array can be divided into pairs such that sum of every pair is divisible by k or else "False" (without quotes).
Constraints:
1<=T<=100
2<=n<=10^5
1<=a[i]<=10^5
1<=k<=10^5
Example:
Input:
2
4
9 7 5 3
6
4
91 74 66 48
10
Output:
True
False
xmyqsh | 194 |
blackshadows | 162 |
Adarsh Trivedi | 144 |
Robert_downey_jr | 143 |
hunterer | 130 |
blackshadows | 644 |
xmyqsh | 535 |
aman19 | 390 |
r0c2048 | 354 |
kspk | 331 |
akhayrutdinov | 5005 |
Ibrahim Nash | 4860 |
Quandray | 4337 |
sanjay05 | 3668 |
blackshadows | 3148 |