HDU 1211 逆元 快速幂

#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
#define ENTER printf("\n");
#define ll long long
using namespace std;
ll p, q, e, l;
ll n, fn;
int t;
void exgcd(ll a, ll b, ll& x, ll& y)
{
	if (!b)
	{
		x = 1;
		y = 0;
		return;
	}
	exgcd(b, a % b, y, x);
	y -= a / b * x;
}
ll quick_pow(ll base, ll pow, ll mod)
{
	ll ans = 1;
	while (pow)
	{
		if (pow & 1)
			ans = (base * ans) % mod;
		pow >>= 1;
		base = (base * base) % mod;
	}
	return ans;
}
int main()
{
	while (scanf("%lld%lld%lld%lld", &p, &q, &e, &l) != EOF)
	{
		n = (ll)p * q;
		fn = ((ll)p - 1) * (q - 1);
		ll d = 0,k = 0;
		exgcd(e, fn, d, k);
		d = (d % fn + fn) % fn;      //解出来的x有可能是负数
		for (int i = 1; i <= l; i++)
		{
			scanf("%d", &t);
			ll ans = quick_pow(t, d, n);
			printf("%c", ans % 128);
		}
		ENTER;
		
		
		
	}
	return 0;
}