比赛链接
A. Perfect Permutation
原题链接
You are given a positive integer n.
The weight of a permutation p1,p2,…,pnis the number of indices 1≤i≤nsuch that idivides pi. Find a permutation p1,p2,…,pnwith 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 nintegers 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;
}