Pagini recente » Cod sursa (job #2134261) | Cod sursa (job #804397) | Rating alupei ciprian (alupeiciprian) | Cod sursa (job #1709117) | Cod sursa (job #2223520)
#include <iostream>
#include <fstream>
using namespace std;
int n,v[10002],t,i;
ifstream f("perle.in");
ofstream g("perle.out");
int B(int);
int C(int);
int B(int i)
{
if(i<=t and i>=1)
{
if(v[i]==2) return B(i+1);
else if(v[i]==1 and v[i+2]==3 and i+4<=t) return C(i+4);
else C(i);
}
else return -1;
}
int C(int i)
{
if(i<=t and i>=1)
{
if(v[i]==2) return i+1;
else if(v[i]==3) return C(B(i+1));
else if(v[i]==1 and v[i+1]==2) return i+3;
else return -1;
}
else return -1;
}
int main()
{
f>>n;
for(int k=1;k<=n;k++)
{
f>>t;
for(i=1;i<=t;i++)
f>>v[i];
if(t>=2)
{
if(B(1)!=-1) g<<1<<"\n";
else g<<0<<"\n";
}
else g<<1<<"\n";
}
}