洛谷 P1226 【模板】快速幂||取余运算

题目链接：https://www.luogu.com.cn/problem/P1226

#include <iostream>
#include <cstdio>

using namespace std;

typedef long long ll;

int quickPow(int a, int b, int m)
{
    int res = 1;
    while (b)
    {
        if (b & 1) res = (ll)res * a % m;
        a = (ll)a * a % m;
        b >>= 1;
    }
    return res;
}

int main()
{
    int a, b, p;
    scanf("%d%d%d", &a, &b, &p);
    
    printf("%d^%d mod %d=%d\n", a, b, p, quickPow(a, b, p));
    
    return 0;
}