做题时没AC,只知道度数应该是偶数,然后WA了好多次。其实顶点应该在一个集合中,反例有N个相互独立的多边形。
学习了并查集后过了。
#include<stdio.h>
int father[1000]={0};
int find(int x)
{
if (father[x]!=x) father[x]=find(father[x]);
return father[x];
}
int main()
{
int n,m;
while (1)
{
int i,a[1000]={0},t1,t2,flag=1,t;
scanf("%d",&n);
if (n==0) break;
for (i=1;i<=n;i++) father[i]=i;
scanf("%d",&m);if (m==0) flag=0;
for (i=1;i<=m;i++) {scanf("%d%d",&t1,&t2);a[t1]++;a[t2]++;t1=find(t1);t2=find(t2);father[t1]=t2;}
t=find(1);
for (i=1;i<=n;i++) if (a[i]%2==1||father[i]!=t) {flag=0;break;}
printf("%d\n",flag);
}
}