[cf]F1. Guess the K-th Zero (Easy version)

题目

交互题，输入"? l r"返回这个区间和，要在20次内找到第$k$个0

思路

对$r$二分，找到第一个让$r-ans=k$的位置

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[1000010];
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int n,t;
	cin>>n>>t;
	int k;
	cin>>k;
	int l=1,r=n,res=n;
	bool flag=0;
	while(l<=r){
		int mid=(l+r)>>1;
		cout<<"? "<<1<<" "<<mid<<endl;
		int ans;
		cin>>ans;
		if(mid-ans>=k){
			res=mid;
			r=mid-1;
		}
		else if(mid-ans<k){
			l=mid+1; 
			}
		}
		cout<<"! "<<res<<endl;
    return 0;
}