欧拉回路【HDOJ1878】

题目链接

#include<cstdio>
#define N 1005
int father[N];
int num[N];
int findFather(int x){
    if(x == father[x]) return x;
    else{
        int tp = findFather(father[x]);
        father[x] = tp;
        return tp;
    } 
} 

int main(){
    int n,m,x,y;
    while(scanf("%d%d",&n,&m) != EOF){
        if(n==0) break;
        for(int i=1;i<=n;i++){
            father[i] = i;
            num[i] = 0;
        }
        for(int i=1;i<=m;i++){
            scanf("%d%d",&x,&y);
            num[x]++;
            num[y]++;
            int fax = findFather(x);
            int fay = findFather(y);
            if(fax != fay){
                father[fax] = fay;
            }
        }
        int ans = findFather(1),tag = 0;//认真想一下这里为什么不能令ans=father[1]呢？ 
        for(int i=2;i<=n;i++){
            if(father[i] != ans||((num[i]&1)==1)){
                tag = 1;
                break;
            }
        }
        if(tag==1) printf("0\n");
        else printf("1\n");
    }
    return 0;
}