#include using namespace std; void output(vector &v) { for (int i = 0; i < v.size(); i++) printf("%s%d", i ? " " : "", v[i]); printf("\n"); } pair query(vector a) { for (int i = 0; i < 4; i++) cout << (i ? " " : "") << a[i]; cout << endl; int x, y; cin >> x >> y; if (x == 4) exit(0); return make_pair(x, y); } int sum(pair p) { return p.first + p.second; } int main() { int d1 = sum(query({ 0, 1, 2, 3 })); int d2 = sum(query({ 6, 7, 8, 9 })); vector e1(10, -10), e2(10, -10); e1[3] = 0; for (int i = 4; i <= 9; i++) { e1[i] = sum(query({ 0, 1, 2, i })) - d1; } e2[6] = 0; for (int i = 0; i <= 5; i++) { e2[i] = sum(query({ i, 7, 8, 9 })) - d2; } int mx1 = *max_element(e1.begin(), e1.end()); int mx2 = *max_element(e2.begin(), e2.end()); vector cand; for (int i = 4; i <= 9; i++) { if (e1[i] == mx1) cand.push_back(i); } for (int i = 0; i <= 5; i++) { if (e2[i] == mx2) cand.push_back(i); } sort(cand.begin(), cand.end()); cand.erase(unique(cand.begin(), cand.end()), cand.end()); do { if (query(cand).first == 4) { return 0; } } while (next_permutation(cand.begin(), cand.end())); }