B.super_log（The Preliminary Contest for ICPC Asia Nanjing 2019）

原题

Now your task is let another slowly function log* x reach a constant value b. Here log* is iterated logarithm function, it means “the number of times the logarithm function iteratively applied on x before the result is less than logarithm base a”.
Formally, consider a iterated logarithm function $lo{g}_a^{\ast }$

$$lo{g}_a^{\ast }(x)=\{\begin{array}{rl}-1& ifx<1\\ 1+lo{g}_a^{\ast }(lo{g}_{a}x)& ifx\ge 1\end{array}$$
Find the minimum positive integer argument x, let $lo{g}_a^{\ast }(x)\ge b$. The answer may be very large, so just print the result x after m.
Input
The first line of the input is a single integer T$(T\le 300)$ indicating the number of test cases.
Each of the following lines contains 3 integers a, b and m.
$$\begin{gathered} 2\le a\le 1000000 \\ 0\le b\le 1000000 \\ 1\le m\le 1000000 \end{gathered}$$

Output
For each test case, output x mod m in a single line.

题目分析

可得，$x=a^{a^{a^{a^{...}}}}modm$ (共b个a),为降低算法的复杂度，使用快速幂和欧拉降阶定理。

快速幂

对于表达式$a^b\%p$，若使用a连乘b次，时间复杂度为$\mathcal{O}(b)$,快速幂方法可以降为$\mathcal{O}(logb)$
具体实现：
将b化为2进制表示：$a_n{a}_{n-1}...a_2{a}_1{a}_0$,则
$$a^b=a^{a_0{2}^0}\times a^{a_1{2}^1}\times ...\times a^{a_n{2}^n}$$
代码实现为：

long long quick_pow(long long a, long long b, long long mod){
	long long res=1;
 	long long base=a;
	while(b!=0){
  		if(b&1!=0){
   			res=res*base%mod;
 	 	}
  		base=base*base%mod;
  		b>>=1;
	}
 	return res;
} 

欧拉定理及欧拉降阶公式

欧拉定理：

若n,a为正整数，且n,a互质，则：
$$a^{\varphi }(n)\equiv 1(modn)$$
$\varphi (n)$通解公式为$\varphi (n)=n\ast (1-\frac{1}{p_1})(1-\frac{1}{p_2})....(1-\frac{1}{p_n})$,$p_i$为n的质因数。

欧拉降阶公式

$$a^b=\{\begin{array}{rlr}& & \\ a^{b\%\varphi (p)}& & gcd(a,p)=1\\ a^b& & gcd(a,p)̸=1\&b<\varphi (p)\\ & & \\ a^{b\%\varphi (p)+\varphi (p)}& & gcd(a,p)̸=1\&b\ge \varphi (p)\end{array}\text{\hspace{1em}(mod(p))}$$

long long phi(long long n)  
{  
	long long ans=n;
    	for(long long i=2;i*i<n;i++){
     		if(n%i==0){
      			ans-=ans/i;    
      			while(n%i==0){
       				n/=i;
   			} 
  		}
 	}
	 if(n>2){
  		ans-=ans/n;
 	}
 	return ans;
}


long long f(long long a, long long n, long long mod){  
 	if(n==1){
  		return a%mod;
 	} 
 	return quick_pow(a,f(a,n-1,phi(mod)),mod)%mod;
}

int main(){
 	int t;
 	scanf("%d",&t);
 	while(t--){
 		 int a,b,m;
 		 scanf("%d%d%d",&a,&b,&m);
 		 printf("%lld\n",f(a,b,m)%m);
 	}
	 return 0;
}

参考链接：
https://blog.csdn.net/qq_37632935/article/details/81264965