Pagini recente » Cod sursa (job #803599) | Cod sursa (job #2223103) | Cod sursa (job #914063) | Cod sursa (job #1689463) | Cod sursa (job #1605707)
#include <iostream>
#include <fstream>
using namespace std;
int a[10005],m,n,i;
int C(int i);
int B(int i);
int B(int i)
{
if(a[i]==2)
return B(i+1);
if(a[i]==1&&a[i+2]==3)
return C(i+4);
return 0;
}
int C(int i)
{
if(a[i]==2)
return i+1;
if(a[i]==3)
return C(B(i+1));
if(a[i]==1&&a[i+1]==2)
return i+3;
}
int main()
{freopen("perle.in","r",stdin);
freopen("perle.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&m);
for(i=1;i<=m;i++)
scanf("%d",&a[i]);
if(m==1||B(1)==m+1||C(1)==m+1)
printf("%d",1);
else
printf("%d",0);
}
return 0;
}