Zball in Tina Town
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.
The following T lines, each line contains an integer n, according to the description.
T≤105,2≤n≤109
分析:找規律,這題就是求 (n-1)!modn(n−1)! mod n。如果nn爲合數,顯然答案爲0.如果nn爲素數,那麼由威爾遜定理可得答案爲 n-1n−1。所以就在於快速判斷一個數是否爲素數。
CODE:
#include <iostream>
#include <cstdio>
#include <string.h>
#include <cmath>
using namespace std;
int xindalamu(int a)
{
if(a%2==0) return 0;
int aa=(a-1)>>1;
int half=(int)sqrt(aa/2.0);
for(int i=1;i<=half;i++)
{
if((aa-i)%(2*i+1)==0) return 0;
}
return 1;
}
int main()
{
int t; cin>>t;
int a[5]={0,0,1,2,2};
while(t--){
int n;
cin>>n;
if(n<5){
printf("%d\n",a[n]);
continue;
}
if(xindalamu(n))
printf("%d\n",n-1);
else
printf("0\n");
}
}