moment, a battle between two distinct saints happens. These legends can be picked self-assertively (it's even conceivable that it is a similar two saints that were battling during the latest possible second). At the point when two saints of equivalent levels battle, no one successes the battle. At the point when two legends of various levels battle, the one with the
Correct answer will be upvoted else downvoted. Computer science.
Every moment, a battle between two distinct saints happens. These legends can be picked self-assertively (it's even conceivable that it is a similar two saints that were battling during the latest possible second).
At the point when two saints of equivalent levels battle, no one successes the battle. At the point when two legends of various levels battle, the one with the more elevated level successes, and his level increments by 1.
The champ of the competition is the main saint that successes in no less than 100500 battles (note that it's conceivable that the competition keeps going forever assuming no legend wins this number of battles, there is no victor). A potential champ is a saint to such an extent that there exists an arrangement of battles that this legend turns into the victor of the competition.
Compute the number of potential champs among n legends.
Input
The primary line contains one integer t (1≤t≤500) — the number of experiments.
Each experiment comprises of two lines. The primary line contains one integer n (2≤n≤100) — the number of saints. The subsequent line contains n integers a1,a2,… ,an (1≤
Output
For each experiment, print one integer — the number of potential victors among the given n legends.
Step by step
Solved in 4 steps with 1 images
