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 111 time as large as its original size. On the second day,it will become 222 times as large as the size on the first day. On the n-th day,it will become nnn 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 TTT, representing the number of cases.
The following TTT lines, each line contains an integer nnn, according to the description.T≤105,2≤n≤109 T \leq {10}^{5},2 \leq n \leq {10}^{9} T≤105,2≤n≤109
Output
For each test case, output an integer representing the answer.
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<algorithm>
#include<cmath>
using namespace std;
bool comp(unsigned long long num)
{
if (num <= 2)
{
return num == 2;
}
if (num % 2 == 0)
{
return false;
}
unsigned long n = sqrt(num);
for (int i = 3; i <= n; i+=2)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
int main()
{
int T;
unsigned long long n;
cin>>T;
while(T--){
scanf("%I64d",&n);
unsigned long long result = 1;
if(n<5){
for( int i = 1; i < n ; ++i )
{
result *= i;
}
cout<<result%n<<endl;
}
else if(comp(n))cout<<n-1<<endl;
else printf("0\n");
}
return 0;
}
Zball in Tina TownAccepts: 541Submissions: 2463Time Limit: 3000/1500 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Problem DescriptionTina Town is a friendly pla