【模板】快速幂

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
long a, k, p, n;

long quc(long a, long k, long p)
{
    int res = 1;
    while(k)
    {
        if(k & 1) res = res*a%p;
        a = a*a%p;
        k >>= 1;
    }
    return res;
}

int main()
{
    scanf("%ld", &n);
    for(int i = 1; i <= n; i++)
    {
        scanf("%ld%ld%ld", &a, &k, &p);
        printf("%ld/n", quc(a, k, p));
    }
    return 0;
}