Average Permutation
Execution time limit is 1 second
Runtime memory usage limit is 128 megabytes
Find a permutation of the integers such that sum of averages of all consecutive triplets is minimized, i.e.
is minimized.
If multiple permutations are possible, print any of them.
Input
The first line contains the number of test cases .
The first and only line of each test case contains an integer , the size of the permutation.
Output
For each test case, print on a new line any permutation which satisfies the above conditions.
Examples
The first test case. Among all possible permutations is one which provides the minimum result:
The second test case. Every permutation of size will have the same value:
Input #1
Answer #1
Submissions 13
Acceptance rate 62%