# Average Permutation CodeChef Solution

### We Are Discuss About CODECHEF SOLUTION

Average Permutation CodeChef Solution

## Problem

You are given an integer N.

Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW Find a permutation P = [P_1, P_2, \ldots, P_N] of the integers \{1, 2, \ldots, N\} such that sum of averages of all consecutive triplets is minimized, i.e.

\sum_{i=1}^{N-2} \frac{P_i + P_{i+1} + P_{i+2}}{3}

is minimized.

If multiple permutations are possible, print any of them.

### Input Format

• The first line of input will contain a single integer T, denoting the number of test cases.
• The first and only line of each test case contains an integer N, the size of the permutation.
Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW ### Output Format

For each test case, output on a new line a permutation which satisfies the above conditions.

### Constraints

• 1 \leq T \leq 1000
• 3 \leq N \leq 10^5
• The sum of N over all test cases won’t exceed 3\cdot 10^5.

## SOLUTION

Yhaa You have done it but next? if YOU Want to Get Others Please Visit Here ScishowEngineer   Then Follow US HERE and Join Telegram.

If You Want To Learn Something New Then Visit Our Official Channel YOUTUBE