cf1167 B - Lost Numbers(交互题+dfs)

传送门

#include <bits/stdc++.h>

using namespace std;

//#define endl "\n"
#define debug cout<<"debug"<<endl
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
const double eps = 1e-8;
const double PI = 3.14159265358979323;
const int N = 2e5+10, M = 2*N, mod = 998244353;
const int INF = 0x3f3f3f3f;

int n;
int d[5];
int a[6] = {4,8,15,16,23,42};

void solve()
{
    // 取{1, 2} {2, 3} {3, 4} {4, 5}的乘积, 利用乘积枚举全排列求解
    for(int i = 1; i<=4; i++)
    {
        cout<<"? "<<i<<" "<<i+1<<endl;
        cin>>d[i];
    }
    do
    {
        if(a[0]*a[1] == d[1] && a[1]*a[2] == d[2] && a[2]*a[3] == d[3] && a[3]*a[4] == d[4])
            break;
    }while(next_permutation(a, a+6));
    cout<<"! ";
    for(int i = 0; i<6; i++) cout<<a[i]<<" ";
    cout<<endl;
}

int main()
{
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int T;
    T = 1;
//    cin>>T;
    while(T -- )
    {
        solve();
    }
    return 0;
}