题解：P13134 [GCJ 2018 Qualification] Go, Gopher!

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

bool dig[3][3];

int main() {
    int T;
    cin >> T;
    while (T --) {
        int A;
        cin >> A;
        for (int i = 3; ; i += 3) {
            memset(dig, 0, sizeof(dig));
            for (int cnt = 0; cnt < 9; ) {
                int I = i, J = 3;
                cout << I << ' ' << J << endl;
                cin >> I >> J;
                if (!I && !J) goto end;
                if (I == -1 && J == -1) return 0;
                if (!dig[I - i + 1][J - 2]) ++ cnt;
                dig[I - i + 1][J - 2] = true;
            }
        }
        end:;
    }
    return 0;
}