1435A - Finding Sasuke - CodeForces Solution

//
// Handle: stEV
//
// 11/25/2023
// 

#include <bits/stdc++.h>

using namespace std;

#define int long long

int n, a[107], b[107];

void solve() {
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    int l = 0, r = n - 1;
    if (n % 2) {
        b[l] = a[r] + a[r - 1], b[l] *= -1;
        b[r] = b[r - 1] = a[l];
        l++, r -= 2;
    }
    while (l < r) {
        b[l] = -a[r], b[r] = a[l];
        l++, r--;
    }
    for (int i = 0; i < n; ++i) {
        cout << b[i] << ' ';
    }
    cout << '\n';
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t; cin >> t; while (t--) solve();
    return 0;
}