Pagini recente » Cod sursa (job #896655) | Cod sursa (job #2287062) | Cod sursa (job #669763) | Cod sursa (job #2636975) | Cod sursa (job #238115)
Cod sursa(job #238115)
#include<iostream.h>
#include<stdio.h>
FILE *f=fopen("perle.in","r"),*g=fopen("perle.out","w");
int n,a[10001];
void b(int i)
{
if(*(a+i)==2)
return b(i+1);
if(*(a+i)==1&&*(a+2+i)==3)
return c(i+4);
}
void c(int i)
{
if(*(a+i)==2)
{
if(i==n)
return 1;
return c(i+1);
}
if(*(a+i)==1&&*(a+i+1)==2)
{
if(i+2==n)
return 1;
return c(i+3);
}
if(*(a+i)==3)
return b(i+1);
return 0;
}
}
int solve()
{
if(n==1)
return 1;
if(n==2)
return 0;
if(a[1)==3)
return c(1);
return b(1);
}
int main()
{
fscanf(f,"%d",&n);
for(int i=1;i<=n;i++)
{
int len;
fscanf(f,"%d",&len);
for(int j=1;j<=len;j++)
fscanf(f,"%d",&a[j]);
fprintf(g,"%d",solve();
}
return 0;
}