HDU-5391 Zball in Tina Town

(n-1)!/n 就是如果n为素数，就等于n-1else为0。

求素数表:

Zball in Tina Town

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

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

 

Output

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

 

Sample Input

2 3 10

 

Sample Output

2 0

 

Source

#include<iostream>
#include <cstdio>
#include<cstring>
using namespace std;
bool is_prime(int n)
{
    for(int i=2;i*i<=n;i++){
         if(n%i==0) return false;
    }
    return n!=1;
}
int main (void)
{
int n,t;
scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        if(n==4)
      {
       printf("2
");
       continue;
       }
        if(is_prime(n))
              printf("%d
",n-1);
        else
           printf("0
");

    }
    return 0;
}