//结论:某节点为根的子树肯定在圆圈上连续的一段
#define mod 998244353
signed main()
{
fast;
int n;
while(cin>>n)
{
vector<int>du(n+1,0);
ll ans=n%mod;
rpp(i,n-1)
{
int x,y;cin>>x>>y;
++du[x],++du[y];
ans= ans* 1LL* du[x] %mod* du[y]%mod;
}
cout<<ans<<endl;
}
return 0;
}
Codeforces Round #564 (Div. 2) D - Nauuo and Circle(树上排列)
最新推荐文章于 2020-04-05 13:25:38 发布