C++常用模板

快速幂

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

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

int main(int argc, char const *argv[])
{
	int n;
	scanf("%d", &n);
	while (n--)
	{
		int a, k, p;
		scanf("%d%d%d", &a, &k, &p);
		printf("%d\n", qmi(a, k, p));
	}
	return 0;
}

用来求a^k mod p的值

推导原理：