Problem Description

To think of a beautiful problem description is so hard for me that let's just drop them off. :)
Given four integers a,m,n,k,and S = gcd(a^m-1,a^n-1)%k,calculate the S.
 

Input

The first line contain a t,then t cases followed.
Each case contain four integers a,m,n,k(1<=a,m,n,k<=10000).

Output

One line with a integer S.

Sample Input

1

1 1 1 1

Sample Output

0

此題需要用到一個結論....

if(a>b&&gcd(a,b)==1)

gcd(a^m-b^m,a^n-b^n)=a^gcd(m,n)-b^gcd(m,n);

程式碼如下：
 

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll a,m,n,k;
int t;
ll Fast (int a,int b)
{
    ll sum=1;
    while (b)
    {
        if(b&1)
        {
            sum=sum*a%k;
        }
        b>>=1;
        a=a*a%k;
    }
    return sum;
}
ll gcd (ll a,ll b)
{
    return b==0? a:gcd(b,a%b);
}
int main()
{
    scanf("%d",&t);
    while (t--)
    {
        scanf("%lld%lld%lld%lld",&a,&m,&n,&k);
        a=a%k;
        ll ans=(Fast(a,gcd(m,n))-1+k)%k;
        printf("%lld\n",ans);
    }
    return 0;
}