题目
个人补充：
#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
#define ll long longconst int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5, base = 37;
const int N = 4e3;
const int mod = 1e9 + 7;
// const int mod = 998244353;
// const __int128 mod = 212370440130137957LL;int n, m;
int a[maxn], b[maxn];
//long long ? maxn ? n? m?int __lcm(int a, int b){return a * b / __gcd(a, b);
}void solve(){ll res = 0;cin >> n;int mx = 0;for(int i = 1; i <= n; i++){cin >> a[i];}int lcm = 1;for(int i = 1; i <= n; i++){lcm = __lcm(lcm, a[i]);}int s = 0;for(int i = 1; i <= n; i++){s += lcm / a[i];}if(s >= lcm){cout << -1 << '\n';return;}for(int i = 1; i <= n; i++){cout << lcm / a[i] << " \n"[i == n];}
}signed main(){ios::sync_with_stdio(0);cin.tie(0);cout << fixed << setprecision(9);int T = 1;cin >> T;while (T--){solve();}return 0;
}
