[完全二分图生成树个数] BZOJ 4766 文艺计算姬

结论题 我也不会证

$$K_{n,m}=n^{m-1}*m^{n-1}$$

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

ll n,m,P;

inline ll mul(ll x,ll y){
  return (x*y-(ll)(((long double)x*y+0.5)/(long double)P)*P+P)%P;
}
inline ll Pow(ll a,ll b){
  ll ret=1; for (;b;b>>=1,a=mul(a,a)) if (b&1) ret=mul(ret,a); return ret;
}

int main(){
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  scanf("%lld%lld%lld",&n,&m,&P);
  printf("%lld\n",mul(Pow(n,m-1),Pow(m,n-1)));
  return 0;
}