Pagini recente » Cod sursa (job #1929918) | Istoria paginii runda/concursul_bebras | Cod sursa (job #106645) | Cod sursa (job #2827718) | Cod sursa (job #2661129)
#include <iostream>
#include <fstream>
#define nl '\n'
using namespace std;
ifstream f ( "perle.in" );
ofstream g ( "perle.out" );
const int NMAX = 10002;
int v[NMAX], n;
int rezC ( int i );
int rezB ( int i )
{
if ( i > n )
return -1;
if ( v[i] == 2 )
return rezB ( i + 1 );
if ( v[i] == 1 && v[i + 2] == 3 )
return rezC ( i + 4 );
return -1;
}
int rezC ( int i )
{
if ( i > n )
return -1;
if ( v[i] == 2 )
return i;
if ( v[i] == 1 && v[i + 1] == 2 )
return i + 2;
if ( v[i] == 3 )
return rezC ( rezB ( i + 1 ) + 1 );
return -1;
}
int main()
{
int T;
f >> T;
while ( T-- )
{
f >> n;
for ( int i = 1; i <= n; i++ )
f >> v[i];
if ( n == 1 || rezB ( 1 ) == n || rezC ( 1 ) == n )
{
g << 1 << nl;
continue;
}
else g << 0 << nl;
}
return 0;
}