大概就是一个排列的和公式吧
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<time.h>
#include<set>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
#define inf 0x7fffffff
#define lc l,m,index<<1
#define rc m+1,r,index<<1|1
#define max_n 4000005
#define mod 1000000007
#define LL unsigned long long
#define max_log 20
LL n;
LL power(int n,LL k)
{
LL ret=1;
LL tmp=k;
while(n)
{
if(n%2)
ret=(ret*tmp)%mod;
tmp=(tmp*tmp)%mod;
n/=2;
}
return ret;
}
int main()
{
int t;
scanf("%d",&t);
int Tcase=1;
while(t--)
{
scanf("%lld",&n);
printf("Case #%d: ",Tcase++);
printf("%lld\n",(n*power(n-1,2))%mod);
}
return 0;
}