#include #define pb push_back #define f first #define s second #define pii pair #define mp make_pair using namespace std; void search(int a, int b, int c, int d) { if (a > b || c > d) return; int mid[2] = {(a + b) / 2, (c + d) / 2}; cout << mid[0] << ' ' << mid[1] << '\n'; cout.flush(); int val; cin >> val; if (val == 0) exit(0); if (val < 0) { search(mid[0] + 1, b, c, mid[1]); search(a, mid[0], mid[1] + 1, d); search(mid[0], b, mid[1], d); } else { search(a, mid[0], c, mid[1]); search(a, mid[0] - 1, mid[1], d); search(mid[0], b, c, mid[1] - 1); } } int main() { int l = 1, r = 200, x = 1, y = 200; search(l, r, x, y); return 0; }