are given an exhibit a1,a2,… ,a comprising of n positive integers and a positive integer m. You should isolate components of this cluster into certain exhibits. You can arrange the components in the new clusters as you need. How about we call an exhibit m-distinguishable if for every two nearby numbers in the cluster (two numbers on the positions I and i+1 are
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 isolate components of this cluster into certain exhibits. You can arrange the components in the new clusters as you need.
How about we call an exhibit m-distinguishable if for every two nearby numbers in the cluster (two numbers on the positions I and i+1 are called contiguous for every I) their aggregate is separable by m. A variety of one component is m-distinct.
Track down the most modest number of m-distinguishable exhibits that a1,a2,… ,an is feasible to isolate into.
Input
The main line contains a solitary integer t (1≤t≤1000) — the number of experiments.
The primary 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
Step by step
Solved in 4 steps with 1 images
