given an exhibit a1,a2,… ,a comprising of n positive integers and a positive integer m. You should separate components of this cluster into certain exhibits. You can arrange the components in the new clusters as you need. How about we call a cluster m-distinct if for every two adjoining numbers in the exhibit (two
Correct answer will be upvoted else downvoted. Computer science.
You are given an exhibit a1,a2,… ,a comprising of n positive integers and a positive integer m.
You should separate components of this cluster into certain exhibits. You can arrange the components in the new clusters as you need.
How about we call a cluster m-distinct if for every two adjoining numbers in the exhibit (two numbers on the positions I and i+1 are called neighboring for every I) their aggregate is separable by m. A variety of one component is m-separable.
Track down the most modest number of m-distinct exhibits that a1,a2,… ,an is feasible to separate into.
Input
The main line contains a solitary integer t (1≤t≤1000) — the number of experiments.
The principal line of each experiment contains two integers n, m (1≤n≤105,1≤m≤105).
The second line of each experiment contains n integers a1,a2,… ,an (1≤
It is ensured that the amount of n and the amount of m over all experiments don't surpass 105.
Output
For each experiment print the response to the issue.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
