Zball in Tina Town

Zball in Tina Town

Accepts: 356

Submissions: 2463

Time Limit: 3000/1500 MS (Java/Others)

Memory Limit: 262144/262144 K (Java/Others)

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≤105,2≤n≤109 T \leq {10}^{5},2 \leq n \leq {10}^{9}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

这题就是求$(n-1)!modn$

如果n为合数，显然答案为0.

如果n为素数，那么由威尔逊定理可得答案为n−1

注意有个trick为  n= 4.

它会每天变大。在第一天的时候，它会变大$1$倍。在第二天的时候，它会变大$2$倍。在第$n$天的时候，它会变大$n$倍。
zball原来的体积是$1$。Tina想知道，zball在第$n-1$天时的体积对$n$取模是多大呢？

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>

using namespace std;

int n;
int main()
{
    int T;
    while(~scanf("%d",&T))
    {
        while(T--)
        {
            int flag=0;
            scanf("%d",&n);
            if(n==2)
                {printf("1\n");
                continue;
                }
            if(n==3)
                {printf("2\n");
                continue;
                }
            if(n==4)
            {printf("2\n");
             continue;
            }

            for(int i=2;i*i<=n;i++)
            {
                if(n%i==0)
                {
                    flag=1;
                    break;
                }
            }
            if(flag==0)
                printf("%d\n",n-1);
            else
                printf("0\n");
        }
    }
}

//用sqrt(n)会超时