快速幂-2025/11/1

/**
 * https://www.luogu.com.cn/problem/P1226
 */
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int a,b,p;
ll ans;

ll quickPower(ll a,ll b){
	ll ans = 1, base = a;
	while(b > 0){
		if(b & 1){
			ans *= base;
			ans %= p;
		}
		base *= base;
		base %= p;
		b >>= 1;
	}
	return ans;
}

int main(){
	cin >> a >> b >> p;
	ans = quickPower(a,b);
	cout << a << "^" << b << " mod " << p << "=" << ans % p;
	return 0;
}s