Pagini recente » Cod sursa (job #1311738) | Cod sursa (job #1549264) | Cod sursa (job #2875842) | Cod sursa (job #2229737) | Cod sursa (job #1161785)
#include <fstream>
using namespace std;
ifstream ka("perle.in");
ofstream ki("perle.out");
int n, a[10005], s;
void sir(int &s, int litera)
{
if(s > a[0])
{
s = a[0] + 10;
return;
}
if(litera == 1)
{
s++;
}
else if(litera == 2)
{
if(a[s] == 2)
{
s++;
sir(s, 2);
}
else if(a[s] == 1)
{
s++;
sir(s, 1);
if(a[s] == 3)
{
s++;
sir(s, 1);
sir(s, 3);
}
}
}
else if(litera == 3)
{
if(a[s] == 2)
{
s++;
}
else if(a[s] == 3)
{
s++;
sir(s, 2);
sir(s, 3);
}
else if(a[s] == 1 && a[s+1] == 2)
{
s += 2;
sir(s, 1);
}
}
}
bool start()
{
sir(s, 1);
if(s == a[0] + 1)
return 1;
s = 1;
sir(s, 2);
if(s == a[0] + 1)
return 1;
s = 1;
sir(s, 3);
if(s == a[0] + 1)
return 1;
return 0;
}
int main()
{
ka >> n;
for(int i = 1; i <= n; i++)
{
ka >> a[0];
for(int j = 1; j <= a[0]; j++)
ka >> a[j];
s = 1;
ki << start() << '\n';
}
}