Question 86

[Mahi1901]

You are given an integer N.

Construct any permutation A of N integers such that the value LCM(1+A1
, 2+A2
,…,N+AN
) is minimized.

A permutation of N integers contains all integers from 1 to N exactly once.

Input Format
First line will contain T, number of test cases. Then the test cases follow.
Each test case contains a single line of input, one integer N.
Output Format
For each test case, output a permutation that minimizes the value LCM(1+A1
, 2+A2
,…,N+AN
).

Constraints
1≤T≤1000
2≤N≤1000
Sample 1:
Input
1
2
Output
2 1

[Shruti-78]

Shruti Koshti
CCOEW
SY Computer
I want to work on this issue.. Can you assign it to me?

[JMukta25]

We cannot assign this issue to you as you have been already assigned 2 issues.

[aditi3004]

HEY!!!
This is Aditi Sharma(SY-C)
MKSSS's CCOEW
Computer Engineering

I want to work on this issue
Please assign this to me.

[Git-Akshat01]

Hi! @JMukta25 Can you please assign me this task.
I am Akshat Tiwari of BIT Raipur from Computer Science Engineering Branch.