Subsegment Divisibility

 JJ challenges his friend GG to construct an array 

A$A$ containing N$N$ distinct elements such that the following conditions hold:

• For all 1≤i≤N$1\le i\le N$, 1≤Ai≤105$1\le A_i\le {10}^5$
• For every subarray of length ≥2$\ge 2$, the sum of all the elements of the subarray is not divisible by the length of the subarray

Please help perplexed GG to complete JJ's challenge.

Input Format

• The first line contains T$T$ - the number of test cases. Then the test cases follow.
• The first and only line of each test case contains an integer N$N$ - the size of the array A$A$ to be constructed.

Output Format

For each test case, output an array A$A$ containing N$N$ distinct elements which satisfy the given conditions.

If there are multiple arrays that satisfy the conditions, print any.

Constraints

• 1≤T≤10$1\le T\le 10$
• 1≤N≤500$1\le N\le 500$

Sample Input 1 

2
3
4

Sample Output 1 

7 2 5
3 18 11 2

Explanation

Test case-1: Following are the subarrays of length ≥2$\ge 2$:

• Length=2$Length=2$: sum([7,2])=9$sum([7,2])=9$, sum([2,5])=7$sum([2,5])=7$
• Length=3$Length=3$: sum([7,2,5])=14$sum([7,2,5])=14$

We can see that for each of these subarrays, the sum is not divisible by the length.

Test case-2: Following are the subarrays of length ≥2$\ge 2$:

• Length=2$Length=2$: sum([3,18])=21$sum([3,18])=21$, sum([18,11])=29$sum([18,11])=29$, sum([11,2])=13$sum([11,2])=13$
• Length=3$Length=3$: sum([3,18,11])=32$sum([3,18,11])=32$, sum([18,11,2])=31$sum([18,11,2])=31$
• Length=4$Length=4$: sum([3,18,11,2])=34$sum([3,18,11,2])=34$

We can see that for each of these subarrays, the sum is not divisible by the length.

• Tweet
• Share
• Share
• Share
• Share

Related Post