题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2685
思路:。。。有个gcd的定理gcd(a^m-b^m,a^n-b^n)=a^gcd(n,m)-b^gcd(n,m);,这里b取1
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod int(1e9+7)
#define pb push_back
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
int a,m,n,k,s;
int gmod(int a,int b,int c)
{
int res=1;
while(b)
{
if(b&1) res=res*a%c;
b>>=1,a=a*a%c;
}
return res;
}
int main()
{
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--)
{
cin>>a>>n>>m>>k;
s=gmod(a,__gcd(n,m),k)+k-1;
cout<<s%k<<endl;
}
return 0;
}