Pagini recente » Cod sursa (job #486175) | Autentificare | Cod sursa (job #1630) | Cod sursa (job #467068) | Cod sursa (job #953498)
Cod sursa(job #953498)
#include<fstream>
using namespace std;
ifstream f("perle.in");
ofstream g("perle.out");
int n,nr,ok,a[100005],i,j,k;
int bkt1(int k);
int bkt2(int k);
int bkt1(int k)
{
if(a[k]==2) return bkt1(k+1);
else if(a[k]==1&&a[k+2]==3) return bkt2(k+4);
return nr+2;
}
int bkt2(int k)
{
if(a[k]==2) return k+1;
else if(a[k]==3) return bkt2(bkt1(k+1));
else if(a[k]==1&&a[k+1]==2) return k+3;
return k+2;
}
int main ()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>nr;
for(j=1;j<=nr;j++)
f>>a[j];
for(j=nr+1;j<=nr+4;j++)
a[j]=-1;
ok=0;
if(nr==1||bkt1(1)==nr+1||bkt2(1)==nr+1) ok=1;
g<<ok<<"\n";
}
return 0;
}