#K85857. Find the Game's Winner(s)

    ID: 36734 Type: Default 1000ms 256MiB

Find the Game's Winner(s)

Find the Game's Winner(s)

In this problem, you are given several test cases. For each test case, you must determine the index (or indices) of the player who scored the highest. Note that player indices are 1-indexed. For a test case, the input consists of an integer ( N ) which indicates the number of players followed by ( N ) floating-point numbers representing the scores. Your task is to output the indices of the players with the maximum score in ascending order.

Essentially, if the scores are represented by ( s_1, s_2, \dots, s_N ), you need to find all indices ( i ) such that ( s_i = \max(s_1, s_2, \dots, s_N) ).

inputFormat

The input is read from standard input and is formatted as follows:

The first line contains an integer ( T ) representing the number of test cases. Then for each test case, the first line contains an integer ( N ) (the number of players), and the next line contains ( N ) space-separated floating-point numbers representing the scores of each player.

outputFormat

For each test case, print a single line containing the 1-indexed positions of the player(s) with the highest score, separated by a single space.## sample

1
3
1 2 1.5
2

</p>