HDU 4351

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  time as large as its original size. On the second day,it will become  times as large as the size on the first day. On the n-th day,it will become  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 , representing the number of cases. 

The following  lines, each line contains an integer , according to the description. 
 

Output

For each test case, output an integer representing the answer.

Sample Input

2
3
10

Sample Output

2
0
规律题，把前20都列举一遍会发现，
当n>4时
当n是素数时的答案是n-1；
当n为其他数时，答案为0

#include <cstring>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
#define N 10005
typedef long long LL;
int a[N];
bool prim(int n)
{
    int f = 0;
    int k = (int)sqrt(n);
    for(int i=2;i<=k;i++)
    {
        if(n % i == 0)
        {
            f = 1;
            break;
        }
    }
    if(f==1)
        return 0;
    return 1;

}
int main()
{
    int n;
    int t;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d",&n);
        if(n==1)
            printf("1
");
        else if(n==4)
            printf("2
");
        else if(prim(n))
            printf("%d
",n-1);
        else
            printf("0
");

    }
    return 0;
}