[Solution] Divisible by i CodeChef Solution

[Solution] Divisible by i CodeChef Solution

[Solution] Divisible by i CodeChef Solution | CodeChef Problem Solution 2022

You are given an integer N$N$.

Construct a permutation P$P$ of length N$N$ such that

• For all i$i$ (1≤i≤N−1)$(1\le i\le N-1)$, i$i$ divides abs(Pi+1−Pi)$abs(P_{i+1}-P_i)$.

Recall that a permutation of length N$N$ is an array where every integer from 1$1$ to N$N$ occurs exactly once.

It can be proven that for the given constraints at least one such P$P$ always exists.

Input Format

• The first line of input contains a single integer T$T$, denoting the number of test cases. The

Solution Click Below:-  CLICK HERE

•  description of T$T$ test cases follow.
• The only line of each test case contains an integer N$N$ - the length of the array to be constructed.

Output Format

For each test case, output a single line containing N$N$ space-separated integers P1,P2,…,PN$P_1,P_2,\dots ,P_N$, denoting the elements of the array P$P$.

Chairs Requirement CodeChef Solution

Subscriptions CodeChef Solution

Alternate Additions CodeChef Solution

Equal Strings CodeChef Solution

Divisible by i CodeChef Solution

Possible GCD CodeChef Solution

Reduce to zero CodeChef Solution

Full Path Eraser CodeChef Solution

Expected move CodeChef Solution

If there exist multiple such arrays, print any.

Constraints

• 1≤T≤5⋅104$1\le T\le 5\cdot {10}^4$
• 2≤N≤105$2\le N\le {10}^5$
• The sum of N$N$ over all test cases does not exceed