快速幂模板题

#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
long long power(long long a, long long b, long long p)
{
	long long t = 1;
	while (b > 0)
	{
		if (b % 2==1) t = t * a %p;
		b/=2;
		a = a * a %p;
	}
	return t;
}
int main()
{
	long long a,b,m;
	cin >> a >> b >> m;
	if(m==1)cout << 0; 
	else cout << power(a,b,m);
}