Pagini recente » Cod sursa (job #1648776) | Cod sursa (job #1743224) | Cod sursa (job #358406) | Cod sursa (job #2298577) | Cod sursa (job #2682845)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("perle.in");
ofstream fout("perle.out");
int s[10005],nsir,n,i,j;
int C(int p);
int B(int p)
{
if(s[p]==2)
return B(p+1);
if(s[p]==1 && s[p+2]==3)
return C(p+4);
return -1;
}
int C(int p)
{
if(s[p]==2)
return p+1;
if(s[p]==3)
{
/// int x=B(p+1);
return C(B(p+1));
}
if(s[p]==1 && s[p+1]==2)
return p+3;
return -1;
}
int main()
{
fin>>nsir;
for(i=1;i<=nsir;i++)
{
fin>>n;
for(j=1;j<=n;j++)
fin>>s[j];
if(n==1 || B(1)==n+1 || C(1)==n+1)
fout<<"1\n";
else
fout<<"0\n";
}
return 0;
}