super_log

https://nanti.jisuanke.com/t/41299 

直接加phi會wa。。。公式沒記清楚

超出phi後才mod在加phi

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------

const int maxn=6e2+9;
const int mod=1e9+7;

//ll Mod(ll x,ll p)
//{
//    if(x>=p) return x%p+p;
//    else return x;
//}
ll pow(ll x,ll y , ll p)
{
    ll ans = 1;

    x%=p;
    while(y)
    {
//        if(y & 1) ans = Mod(ans*x,p);
//        x=Mod(x*x,p) , y >>= 1;

        if(y & 1) ans = ans*x%p;
        x=x*x%p , y >>= 1;
    }


    return ans;
}
ll phi(ll x)
{
    ll i , ans = x;
    for(i = 2 ; i * i <= x ; i ++ )
    {
        if(x % i == 0)
        {
            ans = ans / i * (i - 1);
            while(x % i == 0) x /= i;
        }
    }
    if(x != 1) ans = ans / x * (x - 1);
    return ans;
}
ll cal(ll n,ll m,ll p)
{
    if(p == 1) return 0;
    if(m==0) return 1;
    ll t = phi(p);
    //return pow(n,cal(n,m-1,t)+t,p);///wa!!!!
    ll cc=cal(n,m-1,t);
    if(cc<t&&cc) return pow(n,cc,p);
    else return pow(n,cc+t,p);
}

int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);


    int T;
    cin>>T;
    while(T--)
    {
        ll a,b,m;

        cin>>a>>b>>m;

        ll ans=cal(a,b,m);

        cout<<ans%m<<endl;

    }

    return 0;
}