Pagini recente » Cod sursa (job #1530955) | Cod sursa (job #1481170) | Cod sursa (job #1315351) | Cod sursa (job #798739) | Cod sursa (job #728099)
Cod sursa(job #728099)
#include<fstream>
#define dim 123456
using namespace std;
ifstream f("perle.in");
ofstream g("perle.out");
int a[dim],n;
int k;
int valid2(int x);
int valid1(int x)
{
if(a[x]==1&&a[x+2]==3)
return valid2(x+4);
if(x>=n+1)
return -1;
if(a[x]==2)
return valid1(x+1);
return -1;
}
int valid2(int x)
{
if(a[x]==2)
return x+1;
if(a[x]==1 && a[x+1]==2)
return x+3;
if(a[x]==3)
return valid2(valid1(x+1));
return -1;
}
int sol=valid1(1);
void solve()
{
for(int j=1;j<=k;j++)
{
f>>n;
for(int i=1;i<=n;++i)
f>>a[i];
if(sol!=n+1)
sol=valid2(1);
if(n==1||sol==n+1)
g<<1<<"\n";
else
g<<0<<"\n";
}
}
int main()
{
f>>k;
solve();
return 0;
}