Pagini recente » Cod sursa (job #386766) | Cod sursa (job #3237678) | Cod sursa (job #795881) | Cod sursa (job #2671437) | Cod sursa (job #2298635)
#include <iostream>
#include <fstream>
using namespace std;
int n, l, s, v[10001];
int b(int i=1);
int c(int i=1)
{
if(v[i]==2)
return i;
else if(v[i]==3)
return c(b(i+1));
else if(v[i]==1 && v[i+1]==2)
return i+2;
return -1;
}
int b(int i)
{
if(v[i]==2)
return b(i+1);
else if(v[i]==1 && v[i+2]==3)
return c(i+4);
return -1;
}
int main()
{
ifstream f("perle.in");
ofstream g("perle.out");
f>>n;
for(int i=0; i<n; i++)
{
f>>l;
for(int j=1; j<=l; j++)
f>>v[j];
if(l==1)
{
g<<1<<endl;
continue;
}
if(b()==l || c()==l)
g<<1<<endl;
else
g<<0<<endl;
}
return 0;
}