[ICPC Asia Nanjing 2019] super_log（欧拉定理EXT）

提交地址 

队友发现了规律就是%m(一共b个a)

怎么搞哪？

我记得有个欧拉定理的扩展

这个递归就好了

然而TLE了，想起一个省选题【相逢是问候】，P不断取phi很快就会变成1，x%1肯定是0啊，加个特判，然后WA了。

比赛后才发现只有式子才成立，x小时直接算。

只能说只记式子，不看原理一定会吃亏的。

献上一个小证明

#include<cstdio>
#include<iostream>

using namespace std;

typedef long long LL;

LL fast_pow(LL a,LL x,LL mod) {
    LL ans=1;
    for ( ; x; x>>=1,a=a*a%mod)
        if (x&1) ans=ans*a%mod;
    return ans;
}

LL phi(LL x) {
    LL ret=x;
    for (LL i=2; i*i <= x; i++) 
        if (x%i==0) {
            ret -= ret/i;
            while (x%i==0) x /= i;
        }
    if (x>1) ret -= ret/x;
    return ret; 
}

LL a,b,m;

LL f(LL b,LL m) {
	if (m == 1) return 0;
	if (b == 0) return 1%m;
	//if (b == 1) return a%m;
    LL p=phi(m);
    //if (p == 0) while(1); 
   // if (p == 1) return fast_pow(a,0+p,m);
    LL tp = f(b-1,p);
    if (tp < p && tp) return fast_pow(a,tp,m); 
    return fast_pow(a,tp+p,m);
}

int main() {
    int T; cin>>T;
	while(T--) {
		cin>>a>>b>>m;
		cout<<f(b,m)<<endl;
	}
    return 0;
} 

题面：

In Complexity theory, some functions are nearly O(1)O(1), but it is greater then O(1)O(1). For example, the complexity of a typical disjoint set is O(nα(n))O(nα(n)). Here α(n)α(n) is Inverse Ackermann Function, which growth speed is very slow. So in practical application, we often assume α(n) \le 4α(n)≤4.

However O(α(n))O(α(n)) is greater than O(1)O(1), that means if nn is large enough, α(n)α(n) can greater than any constant value.

Now your task is let another slowly function log*log∗ xx reach a constant value bb. Here log*log∗ is iterated logarithm function, it means “the number of times the logarithm function iteratively applied on xx before the result is less than logarithm base aa”.

Formally, consider a iterated logarithm function log_{a}^*loga∗​

Find the minimum positive integer argument xx, let log_{a}^* (x) \ge bloga∗​(x)≥b. The answer may be very large, so just print the result xx after mod mm.

Input

The first line of the input is a single integer T(T\le 300)T(T≤300) indicating the number of test cases.

Each of the following lines contains 33 integers aa , bb and mm.

1 \le a \le 10000001≤a≤1000000

0 \le b \le 10000000≤b≤1000000

1 \le m \le 10000001≤m≤1000000

Note that if a==1, we consider the minimum number x is 1.

Output

For each test case, output xx mod mm in a single line.

Hint

In the 4-th4−th query, a=3a=3 and b=2b=2. Then log_{3}^* (27) = 1+ log_{3}^* (3) = 2 + log_{3}^* (1)=3+(-1)=2 \ge blog3∗​(27)=1+log3∗​(3)=2+log3∗​(1)=3+(−1)=2≥b, so the output is 2727 mod 16 = 1116=11.

样例输入复制

5
2 0 3
3 1 2
3 1 100
3 2 16
5 3 233

样例输出复制

1
1
3
11
223