HDU - 6235 Permutation （2017CCPC哈尔滨 思维）

Permutation

Problem Description

A permutation  p1,p2,...,pn of  1,2,...,n is called a lucky permutation if and only if  pi≡0(mod|pi−pi−2|) for  i=3...n.

Now you need to construct a lucky permutation with a given  n.

 

Input

The first line is the number of test cases.

For each test case, one single line contains a positive integer  n(3≤n≤105).

 

Output

For each test case, output a single line with  n numbers  p1,p2,...,pn.

It is guaranteed that there exists at least one solution. And if there are different solutions, print any one of them.

 

Sample Input

1 6

 

Sample Output

1 3 2 6 4 5

 

题意：很简单。要注意是排列，就所有数字只能用一次。

解题思路：任何数模1，都为0.所以……看代码……

#include
#include
#include
#include
#include