快速幂模 a^b%p

经典版

#include <iostream>
using namespace std;
typedef long long ll;

ll work(ll base, ll exponent, ll mod)
{
	ll temp = 1;
	while (exponent != 0)
	{
		if (exponent % 2 == 1)
		{
			exponent--;
			temp = (temp*base) % mod;
		}
		else
		{
			exponent /= 2;
			base = (base*base) % mod;
		}
	}

	return temp;
}

使用位运算优化

ll work(ll base, ll exponent, ll mod)
{
	ll temp = 1;
	while (exponent)
	{
		if (exponent & 1)//奇数
		{
			temp = (temp * base) % mod;
		}

		exponent >>= 1;//相当于/2
		base = (base*base) % mod;
	}
	return temp;
}