Pagini recente » Profil costelus1 | Cod sursa (job #3129056) | Istoria paginii utilizator/stefansoare8 | Cod sursa (job #818056) | Cod sursa (job #984889)
Cod sursa(job #984889)
#include<iostream>
#include<stdio.h>
using namespace std;
FILE *f,*g;
int t,n,a[100],i;
int c(int x);
int b(int x)
{if(x>n)
return 0;
if(a[x]==1&&a[x+2]==3)
return c(x+4);
if(a[x]==2)
return b(x+1);
}
int c(int x)
{if(x>n)
return 0;
if(a[x]==1&&a[x+1]==2)
return x+2;
if(a[x]==2)
return x;
if(a[x]==3)
{
int u;
u=b(x+1);
if(u)
return c(x+1);
}
}
int main()
{
f=fopen("perle.in","r");
g=fopen("perle.out","w");
fscanf(f,"%d\n",&t);
while(t--)
{
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
fscanf(f,"%d",&a[i]);
if(n==1||n==b(1)||n==c(1))
fprintf(g,"1\n");
else
fprintf(g,"0\n");
}
}