题目

思路：

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5;
const int N = sqrt(1e9) + 1;const int mod = 1e9 + 7;
// const int mod = 998244353;
//const __int128 mod = 212370440130137957LL;
// int a[505][5005];
// bool vis[505][505];int a[maxn], b[maxn];
bool vis[maxn];
string s[maxn];
int n, m;struct Node{int val, id;bool operator<(const Node &u)const{return val < u.val;}
};
// Node c[maxn];int ans[maxn];
int pre[maxn];//long long ? maxn ? n? m?string get(string s, string t){string res;for(int i = 0; i < s.size(); i++){if(s[i] == t[i]){res += s[i];}else{res += char(3 - (s[i] - '0') - (t[i] - '0') + '0');}}return res;
}void solve(){int res = 0;int q, k;int x;cin >> n;if(n % 2 == 0){a[1] = n / 2;for(int i = 2; i <= n / 2; i++){a[i] = a[i - 1] + 1;}a[n / 2 + 1] = n + 1;for(int i = n / 2 + 2; i <= n; i++){a[i] = a[i - 1] + 1;}}else{a[1] = n - n / 2 + 2;for(int i = 2; i <= n; i++){a[i] = a[i - 1] + 1;}a[1]--, a[n]++;a[n - 1]++;}for(int i = 1; i <= n; i++){cout << a[i] << " \n"[i == n];}
}   signed main(){ios::sync_with_stdio(0);cin.tie(0);int T = 1;cin >> T;while (T--){solve();}return 0;
}