codeforces 1114E

二分搜索最大值，接下来询问，求下两两差的gcd及可

#include<bits/stdc++.h>
using namespace std;
#define fst first
#define sec second
#define sci(num) scanf("%d",&num)
#define scl(num) scanf("%lld",&num)
#define mem(a,b) memset(a,b,sizeof a)
#define cpy(a,b) memcopy(a,b,sizeof b)
typedef long long LL;
typedef pair<int,int> P;
const int MAX_N = 5e3 + 10;
int nums[MAX_N];
int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    srand(19260817);
    int N;
    cin >> N;
    int l = 0,r = 1e9,mx = 1e9;
    int cnt = 0;
    while (l <= r) {
        cnt++;
        int mid = (l + r) >> 1;
        cout << "> " << mid << endl << endl;
        int f; cin >> f;
        if (f) {
            l = mid + 1;
        } else {
            r = mid - 1; mx = mid;
        }
    }
    nums[++nums[0]] = mx;
    int d = 0;
    map<int,bool> vs;
    for (int x,i = 1;i <= min(60 - cnt,N);i++) {
        while (true) {
            x = (LL) rand() * rand() % N + 1;
            if (!vs[x]) {vs[x] = true; break;}
        }
        cout << "? " << x << endl<< endl;
        ++nums[0];
        cin >> nums[nums[0]];
    }
    for (int i = 1;i <= nums[0];i++) {
        for (int j = i + 1;j <= nums[0];j++) {
            d = __gcd(d,abs(nums[i] - nums[j]));
        }
    }
    cout << "! " << mx - (N -1) * d << " " << d << endl;
    return 0;
}