标签：p2 line Codeforces test permutation 810 Div include cases

比赛链接

链接

A. Perfect Permutation

原题链接

链接

You are given a positive integer n.

The weight of a permutation p1,p2,…,pn is the number of indices 1≤i≤n such that i divides pi. Find a permutation p1,p2,…,pn with the minimum possible weight (among all permutations of length n).

A permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1≤t≤10^4). The description of the test cases follows.

The only line of each test case contains a single integer n (1≤n≤10^5) — the length of permutation.

It is guaranteed that the sum of n over all test cases does not exceed 10^5.

Output

For each test case, print a line containing n integers p1,p2,…,pn so that the permutation p has the minimum possible weight.

If there are several possible answers, you can print any of them.

Example

input

2
1
4

outputCopy

1
2 1 4 3

题目大意

构造一个含1~n的长度为n的数列，满足 p[i]/i有最小值。
因此只需要将数组向左移动一位就行。

代码

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>

using namespace std;

void solve()
{
	int n;
	cin >> n;
	
	for(int i = 2;i <= n;i ++)
		cout << i << " ";
	cout << 1 << endl;
	
}

int main()
{
	
	int T;
	cin >> T;
	
	while( T-- )
		solve();
	
	return 0;
}

标签：p2,line,Codeforces,test,permutation,810,Div,include,cases
来源： https://www.cnblogs.com/heystar/p/16533195.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。