Pagini recente » Cod sursa (job #2254821) | Cod sursa (job #637681) | Cod sursa (job #3174575) | Cod sursa (job #2787719) | Cod sursa (job #1629911)
#include <fstream>
using namespace std;
ifstream f("perle.in");
ofstream g("perle.out");
int n,k,v[10009];
int a(int x);
int b(int x);
int a(int x){
if(v[x]==2) return a(x+1);
if(v[x]==1 && v[x+2]==3) return b(x+4);
return 0;
}
int b(int x){
if(v[x]==2)
return x+1;
if(v[x]==3)
return b(a(x+1));
if(v[x]==1 && v[x+1]==2)
return x+3;
}
int main()
{ f>>n;
for(int i=1;i<=n;i++){
f>>k;
for(int j=1;j<=k;j++){
f>>v[j];
}
if(k==1 || a(1)==k+1 || b(1)==k+1)
g<<1<<'\n';
else g<<0<<'\n';
}
return 0;
}