标签：style class blog code http tar
题目大意：给出n，问说有n个节点构成的标号树有多少种。
解题思路：cayley定理的躶题。
#include <cstdio>
#include <cstring>
typedef long long ll;
const ll MOD = 2000000011;
ll Pow (ll x, ll n) {
if (n < 0)
return 1;
ll ans = 1;
while (n) {
if (n&1)
ans = (ans * x) % MOD;
x = (x * x) % MOD;
n /= 2;
}
return ans;
}
int main () {
int cas;
scanf("%d", &cas);
for (int i = 1; i <= cas; i++) {
ll n;
scanf("%lld", &n);
printf("Case #%d: %lld\n", i, Pow(n, n-2));
}
return 0;
}uva 10843 - Anne's game(数论cayley定理),布布扣,bubuko.com
uva 10843 - Anne's game(数论cayley定理)
标签：style class blog code http tar
原文地址：http://blog.csdn.net/keshuai19940722/article/details/33388915
