杭电oj 5391 Zball in Tina Town

Zball in Tina Town

Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 1931 Accepted Submission(s): 978

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.

Output
For each test case, output an integer representing the answer.
Sample Input
2
3
10

Sample Output
2
0
这个题其实就是算出（n-1）！%n
一开始的时候还以为是用大数算呢 但是想着就觉得麻烦，原来是有规律的，如果n是素数的时候，结果是n-1，如果不是的话结果是0，但是要注意n=4的时候，结果不是0是2；
以下附上代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<stack>
#include<math.h>
#include<map>
using namespace std;
int sushu(int a)
{
    int flag=0;
    for(int i=2; i<=sqrt(a); i++)
    {
        if(a%i==0)
        {
            flag=1;
            break;
        }
    }
    if(flag==1)
        return 0;
    else
        return 1;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        if(n==4)
            printf("2\n");
        else
        {
           if(sushu(n)==1)
            printf("%d\n",n-1);
           else
            printf("0\n");
        }
    }
}