显示代码纯文本
#include<cstdio>
#include<cmath>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<set>
#include<utility>
#include<algorithm>
#include<string>
#include<climits>
#include<cstring>
using namespace std;
int n;
int p[200001]={};
int main(){
freopen("and_sorting.in","r",stdin);
freopen("and_sorting.out","w",stdout);
int T,i;
int time;
cin>>T;
for(time=1;time<=T;time++){
cin>>n;
memset(p,0,sizeof(p));
long long s=INT_MAX;
for(i=0;i<n;i++){
cin>>p[i];
if(p[i]!=i){
s=s&p[i];
}
}
cout<<s<<endl;
}
return 0;
}