Pagini recente » Cod sursa (job #54611) | Cod sursa (job #329777) | Cod sursa (job #921053) | Cod sursa (job #3210786) | Cod sursa (job #1849977)
#include <fstream>
using namespace std;
ifstream f ("perle.in");
ofstream g ("perle.out");
int n,m,t,v[10001],i,j;
int culc(int k);
int culb(int k)
{
if(k>m) return 0;
if(v[k]==2) return culb(k+1);
if(v[k]==1&&v[k+2]==3) return culc(k+4);
return 0;
}
int culc(int k)
{
if(k>m) return 0;
if(v[k]==2) return k;
if(v[k]==3)
{
t=culb(k+1);
if(t) return culc(t+1);
else return 0;
}
if(v[k]==1&&v[k+1]==2) return k+2;
return 0;
}
int main()
{
f>>n;
for(i=1;i<=n;++i)
{
f>>m;
for(j=1;j<=m;++j) f>>v[j];
if(m==1) {g<<1<<'\n';continue;}
if(culb(1)!=m&&culc(1)!=m) g<<0<<'\n';
else g<<1<<'\n';
}
return 0;
}
// B -> 2B | 1A3AC
// C -> 2 | 3BC | 12A