Submission #2422475

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<cctype>
/*#define F(a,b) for(register int (a)(1);(a)^((b)+(1));(a)++)
#define P putchar((10))
using namespace std;
int n;
signed main()
{
	scanf("%d",&n);int t,cnt(0),now(0);
	F(i,n){printf("? 1 %d",i),P;scanf("%d",&t);if(t>cnt){cnt=t,now=i;}}cnt=0;F(i,n){printf("? %d %d",now,i),P;scanf("%d",&t);if(t>cnt){cnt=t;}}
	printf("! %d",cnt);
	return P,0;
}*/
using namespace std;
int n,t,cnt,now;
signed main(){cin>>n;for(int i(1);i<=n;i++){cout<<"? 1 "<<i<<endl;cin>>t;if(t>cnt){cnt=t,now=i;}}cnt=0;for(int i=1;i<=n;i++){cout<<"? "<<now<<" "<<i<<endl;cin>>t;if(t>cnt){cnt=t;}}cout<<"! "<<cnt<<endl;return 0;}

Submission Info

Judge Result