HDU 5452 Minimum Cut

HDU 5452 Minimum Cut

/**
HDU 5452 Minimum Cut
http://acm.hdu.edu.cn/showproblem.php?pid=5452
*/

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<cmath>
using namespace std;
#define maxn 200005
int trdu[maxn];
int indu[maxn];
int main(){
    int T,n,m;
    scanf("%d",&T);
    for(int h=1;h<=T;h++){
        scanf("%d%d",&n,&m);
        memset(indu,0,sizeof(indu));
        memset(trdu,0,sizeof(trdu));
        int u,v;
        for(int i=1;i<=m;i++){
            scanf("%d%d",&u,&v);
            if(i<n){
                trdu[u]++;
                trdu[v]++;
            }
            indu[u]++;
            indu[v]++;
        }
        int ans=10000000;
        for(int i=1;i<=n;i++){
            if(trdu[i]==1){
                if(ans>indu[i]){
                    ans=indu[i];
                }
            }
        }
        printf("Case #%d: %d\n",h,ans);
    }
    return 0;
}