RE求调

#include <bits/stdc++.h>
using namespace std;
typedef int ull;

int q;

int main() {
    scanf("%d", &q);
    while (q --) {
        ull k; cin >> k;
        ull a[10000000] = {0};
        if (k == 1) {
            cout << 0 << endl;
            continue;
        } else if (k % 2 == 0) {
            ull cnt = k / 2 + 1;
            for (ull i = 1; i <= cnt; i ++) 
                a[i] = a[i - 1] + 1;
            for (ull i = cnt + 1; i <= k; i ++) 
                a[i] = a[i - 1] - 1;
            cout << a[k] << endl;
            continue;
        } else {
            ull cnt = k - (k / 2);
            for (ull i = 1; i <= cnt; i ++) 
                a[i] = a[i - 1] - 1;
            for (ull i = cnt + 1; i <= k; i ++) 
                a[i] = a[i - 1] + 1;
            cout << a[k] << endl;
            continue;
        }
    }
    return 0;
}