HDU 5379 Mahjong tree （DFS）

#pragma comment(linker, "/STACK:102400000,102400000")
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long LL;
const long long mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int M = 100005;

vector<int>g[M];
LL s[M],ans;

int dfs(int u,int fa)
{
    int tot=1,ns=0,nt=0;
    for(int i=0; i<g[u].size(); ++i)
    {
        int v=g[u][i];
        if(v==fa)
            continue;
        ns++;
        int cnt=dfs(v,u);
        if(cnt>1)
            nt++;
        tot+=cnt;
    }
    if(nt>2)
        return ans=0;
    if(nt)
        ans=ans*2%mod;
    ans=ans*s[ns-nt]%mod;
    return tot;
}

int main()
{
    s[0]=1;
    for(int i=1; i<M; ++i)
    {
        s[i]=s[i-1]*i%mod;
    }

    int t,n;
    int casee=1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(int i=0; i<=n; ++i)
        {
            g[i].clear();
        }
        int u,v;
        for(int i=0; i<n-1; ++i)
        {
            scanf("%d%d",&u,&v);
            g[u].push_back(v);
            g[v].push_back(u);
        }
        if(n==1)
        {
            printf("Case #%d: 1\n",casee++);
            continue;
        }
        ans=1;
        dfs(1,0);
        printf("Case #%d: %I64d\n",casee++,ans*2%mod);

    }

    return 0;

}