HDU 5391 （威尔逊定理 ）

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
int is_prim(int x)
{
    int m=sqrt(x+0.5);
    for(int i=2;i<=m;i++)
    {
        if(x%i==0)
        {
            return 0;
        }
    }
    return 1;
}
int main()
{
    int t;  scanf("%d",&t);
    while(t--)
    {
        int n;  scanf("%d",&n);
        if(n==4)
        {
            printf("2\n");
            continue;
        }
        if(is_prim(n))
        {
            printf("%d\n",n-1);
        }
        else
        {
            printf("0\n");
        }
    }
}

Zball in Tina Town

Time Limit: 1500MS

Memory Limit: 262144KB

64bit IO Format: %I64d & %I64u

Submit Status

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

Source

BestCoder Round #51 (div.2)