Pagini recente » Cod sursa (job #2932828) | Cod sursa (job #1812145) | Cod sursa (job #1894493) | Cod sursa (job #2956533) | Cod sursa (job #1828014)
#include <iostream.h>
#include <fstream.h>
int main (){
int v[100],n,i,c,j,l;
ifstream f("perle.in");
ofstream g("perle.out");
f>>l;
for(j=1;j<=l;j++){ c=1;
f>>n;
for(i=1;i<=n;i++)
f>>v[i]; i=1;
if(n!=1)
while(n!=0 && c==1){
c=0;
if(v[i]==2 || v[i]==3 && n-i+1>2){
c=1; i++;
}
else
if(v[i]==1 && v[i+2]==3 && n-i+1>3){
c=1; i+=4;
}
else
if(v[i]==1 && v[i+1]==2 && n-i+1==3){
i+=2; c=1; break;
}
else
if(n-i+1==1 && v[i]==2){
c=1; break;
}
}
if(c==1)
g<<1<<endl;
else
g<<0<<endl;
}
f.close();
g.close();
}