are given an exhibit a comprising of n (n≥3) positive integers. It is realized that in this exhibit, every one of the numbers with the exception of one are something very similar (for instance, in the cluster [4,11,4,4] all numbers aside from one are equivalent to 4). Print the list of the component that doesn't rise to other people. The numbers in the cluster are numbered from one.
Correct answer will be upvoted else downvoted. Computer science.
You are given an exhibit a comprising of n (n≥3) positive integers. It is realized that in this exhibit, every one of the numbers with the exception of one are something very similar (for instance, in the cluster [4,11,4,4] all numbers aside from one are equivalent to 4).
Print the list of the component that doesn't rise to other people. The numbers in the cluster are numbered from one.
Input
The main line contains a solitary integer t (1≤t≤100). Then, at that point, t experiments follow.
The main line of each experiment contains a solitary integer n (3≤n≤100) — the length of the exhibit a.
The second line of each experiment contains n integers a1,a2,… ,an (1≤
It is ensured that every one of the numbers aside from one in the an exhibit are something very similar.
Output
For each experiment, output a solitary integer — the list of the component that isn't equivalent to other people.
Step by step
Solved in 3 steps with 1 images
