Pagini recente » Cod sursa (job #1918393) | Cod sursa (job #952696) | Cod sursa (job #2909837) | Cod sursa (job #2588857) | Cod sursa (job #1728565)
#include <fstream>
using namespace std;
ifstream fin("perle.in");
ofstream fout("perle.out");
int n,k,v[10009];
int a(int x);
int b(int x);
int a(int x){
if(v[x]==2) return a(x+1);
if(v[x]==1 && v[x+2]==3) return b(x+4);
return 0;
}
int b(int x){
if(v[x]==2)
return x+1;
if(v[x]==3)
return b(a(x+1));
if(v[x]==1 && v[x+1]==2)
return x+3;
}
int main()
{ fin>>n;
for(int i=1;i<=n;i++){
fin>>k;
for(int j=1;j<=k;j++){
fin>>v[j];
}
if(k==1 || a(1)==k+1 || b(1)==k+1)
fout<<1<<'\n';
else fout<<0<<'\n';
}
return 0;
}