Pagini recente » Cod sursa (job #3284605) | Cod sursa (job #3162577) | Cod sursa (job #2556910) | Cod sursa (job #1789713) | Cod sursa (job #1117758)
#include<fstream>
using namespace std;
int n,t,i;
short int V[1<<14];
int xx(int);
int b(int P)
{if(P>n-5)
return 0;
if(V[P]==2)
return b(P+1);
if(V[P]==1 && V[P+2]==3)
return xx(P+4);
return 0;}
int xx(int P)
{if(V[P]==2)
return P+1;
if(V[P]==1 && V[P+1]==2)
return P+3;
if(V[P]==3)
return xx(b(P+1));
return 0;}
int rez()
{if(n==1)
return 1;
if(b(1)==n+1||xx(1)==n+1)
return 1;
return 0;}
int main()
{ifstream q("perle.in");
ofstream w("perle.out");
q>>t;
while(t--)
{q>>n;
for(i=1;i<=n;++i)
q>>V[i];
w<<rez()<<"\n";}
return 0;}