Pagini recente » Cod sursa (job #2047501) | Cod sursa (job #2472171) | Cod sursa (job #1044610) | Cod sursa (job #1673783) | Cod sursa (job #1141172)
#include<fstream>
using namespace std;
ifstream f("perle.in");
ofstream g("perle.out");
int n,l,v[10009],s;
bool ok=true;
int main()
{
f>>n;
for(int j=1;j<=n;++j)
{
f>>l;
for(int i=1;i<=l;++i) v[i]=9;
for(int i=1;i<=l;++i) f>>v[i];
s=l;
while(ok==true)
{
ok=false;
for(int i=1;i<=s;++i)
{
if((v[i]==1 && v[i+1]<=4 && v[i+2]==3 && v[i+3]<=4 && v[i+4]==1 && v[i+5]==2 && v[i+6]<=4) || (v[i]==1 && v[i+1]<=4 && v[i+2]==3 && v[i+3]<=4 && v[i+4]==3 && v[i+5]==5 && (v[i+6]==6|| v[i+6]==2)))
{
v[i]=5;
s=s-6;
ok=true;
for(int k=i+1;k<=l;++k) v[k]=v[k+6];
}
if(v[i]==1 && v[i+1]==2 && v[i+2]<=4)
{
v[i]=6;
s=s-2;
ok=true;
for(int k=i+1;k<=l;++k) v[k]=v[k+2];
}
if(v[i]==3 && v[i+1]==5 &&(v[i+2]==6 || v[i+2]==2))
{
v[i]=6;
s=s-2;
ok=true;
for(int k=i+1;k<=l;++k) v[k]=v[k+2];
}
if(v[i]==2 && v[i+1]==5)
{
ok=true;
v[i]=5;
s=s-1;
for(int k=i+1;k<=l;++k) v[k]=v[k+1];
}
}
}
if(s==1) g<<1<<'\n';
else g<<0<<'\n';
}
f.close();g.close();
return 0;
}