int main()
{
int t,aa,bb;
scanf("%d",&t);
for(int i=1;i<=t;i++)
{
mm=0;
if(i!=1)
printf("\n");
scanf("%d%d",&m,&n);
for(int i=1;i<=m;i++)
{
pa[i]=i;
pa1[i]=0;
}
for(int i=1;i<=n;i++)
{
scanf("%d%d",&aa,&bb);
if(cha(aa)==cha(bb))
{
if(pa1[aa]==pa1[bb])
mm=1;
}
else
bing(aa,bb);
}
printf("Scenario #%d:\n",i);
if(mm)
printf("Suspicious bugs found!\n");
else
printf("No suspicious bugs found!\n");
}
return 0;
}
void bing(int x,int y)
{
int ss,dd;
ss=cha(x);
dd=cha(y);
pa[ss]=dd;
pa1[ss]=(pa1[x]+pa1[y])^1;
}
TEST(ChunkTests, InterpolatesNoiseInputsForSeams) {
const unsigned VOXELS_PER_CHUNK = Units::chunkToVoxel(1);
DummyChunk cha(0, 0, 0);
DummyChunk chb(1, 0, 0);
glm::vec3 a300(cha.getNoiseModuleInput(glm::vec3(VOXELS_PER_CHUNK, 0, 0)));
glm::vec3 b000(chb.getNoiseModuleInput(glm::vec3(0, 0, 0)));
EXPECT_EQ(a300, b000);
}
int cha(int k)
{
if(pa[k]!=k)
{
int ww=pa[k];
pa[k]=cha(pa[k]);
pa1[k]=(pa1[k]+pa1[ww])%2;
}
return pa[k];
}
int main()
{
while(scanf("%d%d%d",&y,&m,&d)!=EOF)
{
if(Illegal())
{printf("illegal\n");continue;}
//printf("%d\n",cha());
get_ans(cha());
}
return 0;
}
int main()
{
int a[20],b,i;
for (i=0;i<7;i++) a[i]=-1*pow(10,7-i);
for (i=7;i<15;i++) a[i]=pow(10,i-7);
for(i=0;i<15;i++) printf("%d ",a[i]);
printf("\n");
scanf("%d",&b);
cha(a,b);
for(i=0;i<16;i++) printf("%d ",a[i]);
printf("\n");
return 0;
}
void main()
{
int a[1000],b[1000],c[2000],countA,countB,i,cn;
printf("Input the a:\n");
for(i = 0; i <= 1000; i++)
{
scanf("%d",&a[i]);
if(a[i] == -9999)
break;
}
countA = i;
BubbleSort(a,countA);
printf("Input the b:\n");
for(i = 0; i <= 1000; i++)
{
scanf("%d",&b[i]);
if(b[i] == -9999)
break;
}
countB = i;
BubbleSort(b,countB);
cn = cha(a,b,c,countA,countB);
for(i = 0; i < cn; i++)
{
if(c[i] == c[i+1])
c[i+1] = -9999;
}
printf("Output the number:\n");
for(i = 0; i < cn; i++)
{
if(c[i] == -9999)
continue;
printf("%d ",c[i]);
if((i + 1) % 10 == 0)
printf("\n");
}
}
