#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
//freopen("in.txt","r",stdin);
int casen;int n;
scanf("%d",&casen);
while(casen--)
{
scanf("%d",&n);
int result=1;
int i=1;
for(i=1;i<=n-2;i++)
{
int temp=(result*n)%10003;
result=temp;
}
cout<<result<<endl;
}
return 0;
}
(精)(图论加强)n阶无向最小生成树的个数是n^n-2
最新推荐文章于 2023-12-24 16:34:53 发布