#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 h[N];
mt19937 rd(time(0));
bool ask(int x)
{
cout<<"> "<<x<<endl;
int t; cin>>t;
if(t == -1) exit(0);
return t;
}
void solve()
{
cin>>n;
// 用二分找到最大值
int l = 0, r = 1e9;
while(l<r)
{
int mid = l+r+1 >> 1;
if(ask(mid)) l = mid;
else r = mid-1;
}
int mx = l+1;
// cout<<mx<<endl;
vector<int> v;
// 计算下可知二分最多30次, 剩余30次尽量多的去选数字, 选完排序, 然后计算相邻项差的gcd即可求出公差
// 可证明这种随机算法的错误率是<1e-9的
for(int i = 1; i<=30; i++)
{
int idx = (rd()%n)+1;
cout<<"? "<<idx<<endl;
int x; cin>>x;
v.push_back(x);
}
sort(v.begin(), v.end());
int d = 0;
for(int i = 1; i<v.size(); i++)
{
d = __gcd(d, v[i]-v[i-1]);
}
cout<<"! "<<mx-(n-1)*d<<" "<<d<<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;
}
cf1114 E. Arithmetic Progression(交互+随机数)
最新推荐文章于 2024-09-14 22:25:23 发布