思路:
#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 = 2e5 + 5, inf = 1e9 + 5, maxm = 4e4 + 5, mod = 998244353, N = 1e6;
int a[maxn], b[maxn];
int n, m;
string s;
bool vis[maxn];
struct Seg{
int l, r;
};
void solve(){
int res = 0;
int k;
cin >> n;
// for(int i = 1; i <= n; i++){
// cin >> a[i];
// }
vector<int> prime;
for(int i = 0; i * i <= n + n; i++){
prime.pb(i * i);
}
int m = prime.size();
for(int i = n - 1; i >= 0; ){
bool flag = 0;
int j = m - 1;
int k;
for(; j >= 0; j--){
k = prime[j] - i;
if(k <= i && k >= 0){
flag = 1;
break;
}
else if(k < 0) break;
}
// cout << i << ' ' << j << ' ' << prime[j] << '\n';
if(!flag){
cout << -1 << '\n';
return;
}
// int l = prime[j] - i;
int l = k;
for(int k = l; k <= i; k++){
b[k] = prime[j] - k;
}
i = l - 1;
}
for(int i = 0; i < n; i++){
cout << b[i] << " \n"[i == n - 1];
}
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
// fac[0] = 1;
// for(int i = 1; i <= N; i++){
// fac[i] = fac[i - 1] * i % mod;
// }
int T = 1;
cin >> T;
while (T--)
{
solve();
}
return 0;
}