/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
intquery(int a, int b, int c, int d){ cout << "? " << a << " " << b << " " << c << " " << d << '\n'; fflush(stdout); int t; cin >> t; if (t == -1) exit(0); return t; }
voidprint(int x, int y){ cout << "! " << x << " " << y << '\n'; fflush(stdout); }
intmain(){ int n; cin >> n; int l = 1, r = n, x = n, y = n; while (l <= r) { int mid = l + r >> 1; if (query(1, mid, 1, n) < mid) { x = mid; r = mid - 1; } else l = mid + 1; } l = 1, r = n; while (l <= r) { int mid = l + r >> 1; if (query(1, n, 1, mid) < mid) { y = mid; r = mid - 1; } else l = mid + 1; } print(x, y); return0; }
/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
intquery(const vector<int> &q){ cout << "? "; for (int x : q) cout << x << " "; cout << '\n'; fflush(stdout); int t; cin >> t; if (t == -1) exit(0); return t; }
voidprint(const vector<int> &a){ cout << "! "; for (int i = 1; i < (int)a.size(); i++) cout << a[i] << " "; cout << '\n'; fflush(stdout); }
intmain(){ int n, k; cin >> n >> k; vector<int> a(n + 1), b(k + 2), q; int s = 0; for (int i = 1; i <= k + 1; i++) { q.clear(); for (int j = 1; j <= k + 1; j++) if (i != j) q.push_back(j); b[i] = query(q); s ^= b[i]; } for (int i = 1; i <= k + 1; i++) a[i] = s ^ b[i]; int pre = 0; for (int i = 1; i < k; i++) pre ^= a[i]; for (int i = k + 2; i <= n; i++) { q.clear(); for (int j = 1; j < k; j++) q.push_back(j); q.push_back(i); a[i] = pre ^ query(q); } print(a); return0; }
/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
intquery(i64 x){ cout << "query " << x << '\n'; fflush(stdout); int t; cin >> t; return t; }
intmain(){ int sum = query(0); i64 ans = 0, p = 1; for (int i = 0; i < 18; i++, p *= 10) { int l = 0, r = 9, t = 0; while (l <= r) { int mid = l + r >> 1; if (query(mid * p) == sum + mid) { t = mid; l = mid + 1; } else r = mid - 1; } ans += (9 - t) * p; } print(ans); return0; }
/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
intquery(int l, int r){ int k = r - l + 1; cout << "? " << k << " "; for (int i = l; i <= r; i++) cout << i << " "; cout << '\n'; fflush(stdout); int t; cin >> t; if (t == -1) exit(0); return t; }
intqry(int l, int r, int qi, int qj){ int k = r - l + 3; cout << "? " << k << " " << qi << " " << qj << " "; for (int i = l; i <= r; i++) cout << i << " "; cout << '\n'; fflush(stdout); int t; cin >> t; if (t == -1) exit(0); return t; }
voidprint(int i, int j, int k){ cout << "! " << i << " " << j << " " << k << '\n'; fflush(stdout); }
voidsolve(){ int n; cin >> n; n = 2 * n + 1; int l = 1, r = n; int ql, qr, m; while (l <= r) { int mid = l + r >> 1; if ((query(1, mid) & 1) ^ (mid & 1)) { qr = mid; r = mid - 1; } else l = mid + 1; } l = 1, r = n; while (l <= r) { int mid = l + r >> 1; int d = n - mid + 1; if ((query(mid, n) & 1) ^ (d & 1)) { ql = mid; l = mid + 1; } else r = mid - 1; } l = ql + 1, r = qr - 1; if (l == r) { print(ql, l, qr); return; } while (l <= r) { int mid = l + r >> 1; int d = mid - l + 1; if ((qry(l, mid, ql, qr) & 1) ^ (d & 1)) { m = mid; r = mid - 1; } else l = mid + 1; } print(ql, m, qr); }
intmain(){ int t; cin >> t; while (t--) solve(); return0; }
/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
vector<int> query(i64 k){ cout << "? " << k << '\n'; fflush(stdout); int n; cin >> n; if (n == -1) exit(0); vector<int> p(n); for (int &x : p) cin >> x; return p; }
voidsolve(){ int n; cin >> n; int m = 0; vector<vector<int>> g(n + 1); vector<i64> cnt(n + 1, -1); function<void(int)> calc = [&](int v) { if (cnt[v] != -1) return; cnt[v] = 1; for (int u : g[v]) { calc(u); cnt[v] += cnt[u]; } }; vector<int> pre = {1}; i64 k = 2; while (true) { vector<int> cur = query(k); if (cur.empty()) break; int t = 0; while (t < (int)pre.size() && t < (int)cur.size() && pre[t] == cur[t]) t++; if (t < (int)pre.size()) calc(pre[t]); if (t) { g[cur[t - 1]].push_back(cur[t]); m++; } if (cnt[cur[t]] == -1) k++; else k += cnt[cur[t]]; pre = cur; } cout << "! " << m << '\n'; for (int v = 1; v <= n; v++) for (int u : g[v]) cout << v << " " << u << '\n'; fflush(stdout); }
intmain(){ int t; cin >> t; while (t--) solve(); return0; }
/* Fufffh */ #include<bits/stdc++.h> usingnamespace std; using i32 = int32_t; using i64 = int64_t; using i128 = __int128_t; using u32 = uint32_t; using u64 = uint64_t; using u128 = __uint128_t;
intinsert(i64 x){ cout << "I " << x << '\n'; fflush(stdout); int t; cin >> t; if (t == -1) exit(0); return t; }
intquery(i64 x){ cout << "Q " << x << '\n'; fflush(stdout); int t; cin >> t; if (t == -1) exit(0); return t; }
voidprint(int k, i64 c){ cout << "A " << k << " " << c << '\n'; fflush(stdout); }
voidsolve(){ int n; cin >> n; cout << 0 << '\n'; fflush(stdout); int sz = insert(0); if (sz == 1) { i64 c = 0; for (int i = 0; i < n; i++) { int t = insert(1LL << i); if (t > sz) c |= 1LL << i; sz = t; } print(1, c); return; } i64 l = 1, r = (1LL << n) - 1, c = 1; while (l <= r) { i64 mid = l + r >> 1; if (query(mid)) { c = mid; l = mid + 1; } else r = mid - 1; } if (c & (c - 1)) { i64 b = c & -c; print(insert(b) > sz ? 3 : 2, c); return; } i64 b = c == 1 ? 2 : 1; i64 x = c | b; insert(x); print(query(x) ? 2 : 3, c); }
intmain(){ int t; cin >> t; while (t--) solve(); return0; }