Codeforces Round 673 (Div. 1) |
---|
Finished |
You are given an array a consisting of n positive integers, numbered from 1 to n. You can perform the following operation no more than 3n times:
After each operation, all elements of the array should be non-negative.
Can you find a sequence of no more than 3n operations after which all elements of the array are equal?
The first line contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.
The first line of each test case contains one integer n (1≤n≤104) — the number of elements in the array. The second line contains n integers a1,a2,…,an (1≤ai≤105) — the elements of the array.
It is guaranteed that the sum of n over all test cases does not exceed 104.
For each test case print the answer to it as follows:
If there are multiple suitable sequences of operations, print any of them. Note that you don't have to minimize k.
3 4 2 16 4 18 6 1 2 3 4 5 6 5 11 19 1 1 3
2 4 1 2 2 3 3 -1 4 1 2 4 2 4 5 2 3 3 4 5 1
Name |
---|