这是一个N阶完全图求生成树个数的题。
答案就是n^(n-2)%mod;
代码:
import java.util.Scanner;
import java.math.BigInteger;
public class Main {
public static void main(String args[]) {
Scanner cin = new Scanner(System.in);
int T;
T = cin.nextInt();
for (int i = 0; i < T; i++) {
int n = cin.nextInt();
BigInteger sum = BigInteger.ONE;
for (int j = 1; j <= n - 2; j++) {
sum = sum.multiply(BigInteger.valueOf(n)).mod(BigInteger.valueOf(10003));
}
System.out.println(sum);
}
}
}