【高次幂取模的应用】HDU 3609 Up-up

[size=medium]KIDx 的解题报告
[b]题目很容易看懂：[/b][url]http://acm.hdu.edu.cn/showproblem.php?pid=3609[/url]

[b]降幂公式：[/b][img]http://dl.iteye.com/upload/attachment/595646/98b16dea-778d-3fe9-b1b3-4d348423e496.jpg[/img]

[b][color=red]这速度可以排到前10了：[/color][/b][img]http://dl.iteye.com/upload/attachment/595649/32dd74ad-7d51-3b91-a1b9-51cb07ccd20e.jpg[/img]
[/size]

#include <iostream>
using namespace std;
#define LL unsigned __int64
#define M 205

int phi[M];

int Euler (int n)    //求n的欧拉值
{
	int i, res = n;
	for (i = 2; i * i <= n; i++)
	{
		if (n % i == 0)
		{
			res = res - res/i;
			while (n % i == 0)
				n /= i;
		}
	}
	if (n > 1)
		res = res - res/n;
	return res;
}

LL qmod (LL a, LL b, int c)    //快速幂取模
{
	LL res = 1;
	for ( ; b; b >>= 1)
	{
		if (b & 1)
			res = res * a % c;
		a = a * a % c;
	}
	return res;
}

LL isok (LL a, LL b, int c)    //目的是判断a^b是否>=c
{
	LL res = 1, i;
	for (i = 0; i < b; i++)
	{
		res *= a;
		if (res >= c)
			return res;
	}
	return res;
}

LL upup (LL a, int k, int num)    //按照题意递归地使用公式
{
	if (phi[num] == 1) return 1;    //显然符合公式条件，很容易套公式知道是1，这实际上是剪枝
	if (k == 1) return a % phi[num];//返回上一层的a的幂
	LL b = upup (a, k-1, num+1);    //得到a的幂b
	LL x = isok (a, b, phi[num]);
	if (x >= phi[num])    //使用公式的条件，满足条件可以进行降幂，返回的是上层a的幂
		return qmod (a % phi[num], b, phi[num]) + phi[num];
	else return x;    //不使用公式，直接返回a^b，也属于上层a的幂
}

int main()
{
	LL a;
	int k;
	phi[0] = 100000000;
	for (k = 1; k < M; k++)
		phi[k] = Euler (phi[k-1]);    //预处理所需欧拉值
	while (~scanf ("%I64u%d", &a, &k))
	{
		printf ("%I64u\n", upup (a, k, 0) % phi[0]);
	}
    return 0;
}