Pagini recente » Cod sursa (job #430754) | Cod sursa (job #2939210) | Cod sursa (job #1538291) | Cod sursa (job #826281) | Cod sursa (job #2714777)
#include <fstream>
using namespace std;
ifstream f("perle.in");
ofstream g("perle.out");
int a[100001],n,l;
int perleB(int k);
int perleC(int k);
int perleB(int k)
{
if(a[k]==1&&a[k+2]==3)perleC(k+4);
if(a[k]==2)perleB(k+1);
return 0;
}
int perleC(int k)
{
if(a[k]==1&&a[k+1]==2)return k+3;
if(a[k]==3)return perleC(perleB(k+1));
if(a[k]==2)return k+1;
return 0;
}
int main()
{
f>>n;
for(int k=1; k<=n; k++)
{
f>>l;
for(int i=1; i<=l; i++)f>>a[i];
if(l==1||perleB(1)==l+1||perleC(1)==l+1)g<<1<<'\n';
else
g<<0<<'\n';
}
return 0;
}