Pagini recente » Cod sursa (job #2801375) | Rating Emilian Miron (enslaver) | Cod sursa (job #754325) | Cod sursa (job #2920040) | Cod sursa (job #1591153)
#include <fstream>
using namespace std;
ifstream fin("perle.in");
ofstream fout("perle.out");
int n,a[10001],i;
int mutareB(int k)
{
if (k+1<=a[0])
if (a[k]==2) return mutareB(k+1);
if (k+4<=a[0])
if (a[k+2]==3&&a[k]==1) return mutareC(k+4);
return -1;
}
int mutareC(int k)
{
if (k+2<=n)
if (a[k]==3) return mutareC(mutareB(k+1));
if (k+2<=n)
if (a[k]==1&&a[k+1]==2) return k+2;
if (k<=n)
if (a[k]==2) return k+1;
return -1;
}
int main()
{
fin>>n;
for (i=1; i<=n; i++)
{
fin>>a[0];
for (int j=1; j<=a[0]; j++) fin>>a[j];
if (n==1||mutareB(1)==n+1||mutareC(1)==n+1)
fout<<'1';
else fout<<'0';
fout<<'\n';
}
}