CodeForces - 1451E2（交互）
90nwyn
2020-11-22 12:42:14
[题目链接](https://vjudge.net/problem/CodeForces-1451E2)
------------
------------
```cpp
#include <bits/stdc++.h>
using namespace std;
const int M=1e5+5;
int n,a[M],ans,pos[M];
void output()
{
printf("!");
for(int i=1;i<=n;i++)printf(" %d",ans^a[i]);
puts("");fflush(stdout);
}
int main()
{
scanf("%d",&n);
for(int i=2;i<=n;i++)
{
printf("XOR 1 %d\n",i);fflush(stdout);
scanf("%d",&a[i]);
}
for(int i=1;i<=n;i++)
{
if(pos[a[i]])
{
printf("AND %d %d\n",pos[a[i]],i);fflush(stdout);
int x;scanf("%d",&x);
ans=x^a[i];
output();
return 0;
}
else pos[a[i]]=i;
}
printf("AND 1 %d\n",pos[1]);fflush(stdout);
int t1;scanf("%d",&t1);
printf("AND 1 %d\n",pos[2]);fflush(stdout);
int t2;scanf("%d",&t2);
ans=t1|t2;
output();
return 0;
}
```