| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
大家帮忙过来看看这个程序! (2492)
#include "stdio.h"
int main()
{
int i,j,k,time,num,pair,bug1,bug2,a[2001],flag;
scanf("%d",&time);
for(k=0;k<time;k++)
{
flag=0;
for(i=0;i<2000;i++)
a[i]=-1;
scanf("%d%d",&num,&pair);
for(j=0;j<pair;j++)
{
scanf("%d%d",&bug1,&bug2);
if(a[bug1]==-1&&a[bug2]==-1){
a[bug1]=0;
a[bug2]=1;
}
else
if(a[bug1]!=-1&&a[bug2]==-1)
a[bug2]=(1+a[bug1])%2;
else
if(a[bug2]!=-1&&a[bug1]==-1)
a[bug1]=(1+a[bug2])%2;
else
if(a[bug1]==a[bug2])
flag=1;
}
printf("Scenario #%d:\n",k+1);
if(flag==1)
printf("Suspicious bugs found!\n");
else
printf("No suspicious bugs found!\n");
}
return 1;
}
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator