View Code of Problem 2190

#include<stdio.h>
#include<stdlib.h>
int main(void)
{
	int N,i,j = 1,n,m,a1,b1,count = 1,flag = 0;
	int a[2001],b[2001];
	scanf("%d",&N);
	while(j <= N)
	{
		for(i = 0;i < 2001;i ++)
			a[i] = b[i] = 0;
		//count = 1;
		scanf("%d %d\n",&a1,&b1);
		while(b1 --)
		{
			scanf("%d %d",&n,&m);
			if(!flag)
			{
				if((a[n]&&a[m])||(b[n]&&b[m]))
					flag = 1;
				else if((!a[n]&&!a[m])&&(!b[n]&&!b[m]))
				{
					a[n] = 1;
					b[m] = 1;
				}
				else if(a[n])
					b[m] = 1;
				else if(b[n])
					a[m] = 1;
				else if(b[m])
					a[n] = 1;
				else if(a[m])
				b[n] = 1;
			}
		}
		if(!flag)
			printf("Scenario #%d:\nNo suspicious bugs found!\n",count);
		else
			printf("Scenario #%d:\nSuspicious bugs found!\n",count);
		count ++;
		j ++;
		flag = 0;
	}
	

	return 0;
}