Pagini recente » Cod sursa (job #1242011) | Cod sursa (job #1600052) | Cod sursa (job #1668684) | Cod sursa (job #137306) | Cod sursa (job #2925503)
#include <fstream>
using namespace std;
ifstream cin ("perle.in");
ofstream cout ("perle.out");
int n, l1, a[10002];
int solveB(int p);
int solveC(int p);
int solveB (int p)
{
if(a[p] == 2)
return solveB(p+1);
else if(a[p] == 1 && a[p+2] == 3)
return solveC(p+4);
return 0;
}
int solveC (int p)
{
if(a[p] == 2)
return p+1;
else if(a[p] == 3)
return solveC(solveB(p + 1));
else if(a[p] == 1 && a[p + 1] == 2)
return p + 3;
return 0;
}
int main()
{
int test;
cin >> test;
while(test--)
{
cin >> n;
for(int i=1; i<=n; i++)
cin >> a[i];
if(n == 1 || solveB(1) == n + 1 || solveC(1) == n + 1)
cout << "1\n";
else
cout << "0\n";
}
return 0;
}