Hypyt

#include <bits/stdc++.h>

#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using namespace std;
using ll = long long;

const int inf = 1e9;
const ll LLInf = 1e18;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> pos;

    bool flag = 0;
    for (int lo = 0, hi = n - 1; lo <= hi; ++lo, --hi) {
        for (int le = 0, ri = m - 1; le < m; ++le, --ri) {
            if (lo == hi && ri <= le) {
                if (le == ri) pos.emplace_back(lo, ri);
                break;
            }
            if (flag) {
                pos.emplace_back(lo, ri);
                pos.emplace_back(hi, le);
            } else {
                pos.emplace_back(lo, le);
                pos.emplace_back(hi, ri);
            }
        }
        flag = !flag;
    }

    vector<pair<int, int>> ans;
    for (int i = 1; i < sz(pos); ++i) {
        ans.emplace_back(pos[i].first - pos[i - 1].first, pos[i].second - pos[i - 1].second);
    }

    for (auto [y, x] : ans) {
        cout << y << " " << x << "\n";
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t; cin >> t;
    while (t--) solve();
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: ACCEPTED

Test 5

Group: 2

Verdict: ACCEPTED