Pagini recente » Cod sursa (job #1176076) | Cod sursa (job #1204549) | Cod sursa (job #618514) | Cod sursa (job #1852992) | Cod sursa (job #889487)
Cod sursa(job #889487)
#include <cstdio>
using namespace std;
int a[10002],n,i,m,j;
int B(int);
int C(int);
int B(int i)
{if (i<=m)
{if (a[i]==1 && a[i+2]==3) return C(i+4);
else if (a[i]==2) return B(i+1);
}
return 0;
}
int C(int i)
{if (i<=m)
{if (a[i]==2) return i;
else if (a[i]==3) return C(B(i+1)+1);
else if (a[i]==1 && a[i+1]==2) return i+2;
}
return 0;
}
int main()
{FILE *f1 = fopen("perle.in","r");
FILE *f2 = fopen("perle.out","w");
fscanf(f1,"%d",&n);
for (i=1;i<=n;i++)
{fscanf(f1,"%d",&m);
for (j=1;j<=m;j++) fscanf(f1,"%d",&a[j]);
if (m==1) fprintf(f2,"1\n");
else
{if (B(1)==m || C(1)==m) fprintf(f2,"1\n");
else fprintf(f2,"0\n");
}
}
fclose(f1);fclose(f2);
return 0;
}