一笔画问题,只要满足连通分量是1且所有点的度是偶数即可
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<set>
#include<math.h>
#include<string.h>
#define N 1000
using namespace std;
int f[N],d[N];
int find(int x){
if(x==f[x])return x;
return f[x]=find(f[x]);
}
int main(){
int n,m,i;
while(scanf("%d",&n),n)
{
scanf("%d",&m);
for(i=1;i<=n;i++)f[i]=i;
memset(d,0,sizeof(d));
while(m--)
{
int a,b;scanf("%d%d",&a,&b);
f[find(b)]=find(a);
d[a]++,d[b]++;
}
int father=f[1],succ=1;
for(i=1;i<=n;i++)
if(f[i]!=father){succ=0;break;}
else if(d[i]&1){succ=0;break;}
printf("%d\n",succ);
}
return 0;
}