HDU-5391 威尔逊定理

Problem Description
Tina Town is a friendly place. People there care about each other.
Tina has a ball called zball. Zball is magic. It grows larger every day. On the first day, it becomes 1 time as large as its original size. On the second day,it will become 2 times as large as the size on the first day. On the n-th day,it will become n times as large as the size on the (n-1)-th day. Tina want to know its size on the (n-1)-th day modulo n.
Input
The first line of input contains an integer T, representing the number of cases.
The following T lines, each line contains an integer n, according to the description.
T≤10 ^ 5,2≤n≤10 ^ 9
Output
For each test case, output an integer representing the answer.

Sample Input
2
3
10
Sample Output
2
0
解题思路：
p为素数时：(p-1)! ≡ -1 ( mod p )
求ans = (p-1)! mod p
若p为素数，ans=p-1;
若n=4,ans=2;
此外ans=0;
代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline int read(){
    	int x=0,f=0;char ch=getchar();
    	while(ch>'9'||ch<'0')f|=ch=='-',ch=getchar();
    	while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
    	return f?-x:x;
}
const int S=5;
ll qmul(ll a,ll b,ll c){
	ll ans=0;
	a%=c,b%=c;
	while(b){
		if(b&1){
			ans+=a;
			if(ans>c)ans-=c;
		}
		a<<=1;;
		if(a>c)a-=c;
		b>>=1;
	}
	return ans;
}
ll qpow(ll a,ll b,ll c){
	ll ans=1;
	a%=c;
	while(b){
		if(b&1)ans=qmul(ans,a,c);
		a=qmul(a,a,c);
		b>>=1;
	}
	return ans;
}
bool check(ll a,ll n,ll x,ll t){
	ll ans=qpow(a,x,n);
	ll last=ans;
	for(int i=1;i<=t;++i){
		ans=qmul(ans,ans,n);
		if(ans==1&&last!=i&&last!=n-1)return true;
		last=ans;
	}
	return ans!=1;
}
bool Miller_Rabin(ll n){
	if(n<2)return false;
	if(n==2||n==3||n==5||n==7)return true;
	if((n&1)==0)return false;
	ll x=n-1,t=0;
	srand(time(NULL));
	for(int i=0;i<S;++i){
		ll a=rand()%(n-1)+1;
		if(check(a,n,x,t))return false;
	}
	return true;
}
int main(){
	int t=read();
	while(t--){
		int n=read();
		if(n==4){
			puts("2");
			continue;
		}
		if(Miller_Rabin(n))printf("%d\n",n-1);
		else puts("0");
	}
	return 0;
}