bzoj2467生成树

题目：http://www.lydsy.com/JudgeOnline/problem.php?id=2467

大水题。

#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
const int Mod=;
int t;
ll n;
long long pw(int k)
{
    long long ret=,tmp=;
    while(k)
    {
        if(k&)ret=(ret*tmp)%Mod;
        k>>=;
        tmp=(tmp*tmp)%Mod;
    }
    return ret;
}
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lld",&n);
        printf("%lld\n",(n**pw(n-)%));
    }
    return ;
}