Pagini recente » Rating Stefan Radu-Ioan (stefanradu5) | Statistici Boanca Tudor (btudor55) | Istoria paginii utilizator/halfbloodstranger | Istoria paginii utilizator/andrei828 | Cod sursa (job #1371856)
#include <fstream>
using namespace std;
ifstream f("perle.in");
ofstream g("perle.out");
int X[10000];
int p;
bool megold_b();
bool megold_c();
int n;
int main()
{
int N, j;
f >> N;
int i;
for (i = 0; i < N; i++)
{
f >> n;
for (j = 0; j < n; j++)
{
f >> X[j];
}
p = 1;
if (n != 1)
{
if (X[0] == 2)
megold_b();
else
megold_c();
}
if (n == 1)
g << "1\n";
else if (p == n - 1)
g << "1\n";
else
g << "0\n";
}
}
bool megold_b()
{
if (X[p] == 2)
{
p++;
megold_b();
}
if (X[p] == 1)
{
if (X[p + 2] != 3)
{
p = 0;
return false;
}
p+=4;
megold_c();
}
return false;
}
bool megold_c()
{
if(X[p] == 2)
return false;
if(X[p] == 3)
{
p++;
megold_b();
megold_c();
return false;
}
if (X[p] == 1)
{
if (X[++p] != 2)
return false;
p++;
return false;
}
}