题目大意
定义运算 ( a , n ) (a,n) (a,n)为 a a a上面不断叠 n − 1 n-1 n−1个 a a a作为幂,例如 ( 2 , 4 ) (2,4) (2,4)等价于 2 2 2 2 2^{2^{2^{2}}} 2222。给定 a , n ( 1 ≤ a , n ≤ 1 0 100000 ) a,n(1 \leq a,n \leq 10^{100000}) a,n(1≤a,n≤10100000),求出其个位数。
解题思路
比较裸的欧拉降幂题目了,但是还是要先观察规律,首先根据欧拉降幂 a n % p = ( a % p ) n % φ ( p ) + φ ( p ) a^n \%p = (a\%p)^{n\% \varphi(p)+\varphi(p)} an%p=(a%p)n%φ(p)+φ(p),那么从低到高观察:
a a . . . = ( a % 10 ) ( a . . . ) % 4 + 4 , φ ( 10 ) = 4 a^{a^{...}} = (a\%10)^{(a^{...})\%4 + 4},\varphi(10) = 4 aa...=(a%10)(a...)%4+4,φ(10)=4
( a % 10 ) ( a . . . ) % 4 + 4 = ( a % 10 ) ( ( a % 4 ) ( a . . . ) % 2 + 2 ) % 4 + 4 , φ ( 4 ) = 2 (a\%10)^{(a^{...})\%4 + 4} = (a\%10)^{((a\%4)^{(a^{...})\%2+2})\%4 + 4},\varphi(4) = 2 (a%10)(a...)%4+4=(a%10)((a%4)(a...)%2+2)%4+4,φ(4)=2
( a % 10 ) ( ( a % 4 ) ( a . . . ) % 2 + 2 ) % 4 + 4 = ( a % 10 ) ( ( a % 4 ) ( a % 2 ) ( a . . . ) % 1 + 1 % 2 + 2 ) % 4 + 4 = ( a % 10 ) ( ( a % 4 ) ( a % 2 ) % 2 + 2 ) % 4 + 4 , φ ( 2 ) = 1 (a\%10)^{((a\%4)^{(a^{...})\%2+2})\%4 + 4} = (a\%10)^{((a\%4)^{(a\%2)^{(a^{...})\%1+1}\%2+2})\%4 + 4} = (a\%10)^{((a\%4)^{(a\%2)\%2+2})\%4 + 4} , \varphi(2) = 1 (a%10)((a%4)(a...)%2+2)%4+4=(a%10)((a%4)(a%2)(a...)%1+1%2+2)%4+4=(a%10)((a%4)(a%2)%2+2)%4+4,φ(2)=1
那么显然只需要最多 3 3 3步就可以得到答案,对于 n < 3 n<3 n<3的情况特判一下就好了。
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define ENDL "\n"
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 5e5 + 10;
const int Mod = 1e9 + 7;
int phi = 4;
int getMod(string num, int p) {
int ans = 0;
for (int i = 0; i < num.size(); i++) {
ans = (ans * 10 + num[i] - '0') % p;
}
return ans;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
string a, n;
cin >> a >> n;
if (a == "1") {
cout << 1 << ENDL;
return 0;
}
int len = a.size();
int m10 = getMod(a, 10), m4 = getMod(a, 4), last = a[len - 1] - '0';
if (n == "1") {
cout << last << ENDL;
} else if (n == "2") {
int y = getMod(a, 4) + 4;
int ans = 1;
for (int i = 1; i <= y; i++) ans = ans * m10 % 10;
cout << ans << ENDL;
} else {
int z = getMod(a, 2) + 2;
int y = 1, ans = 1;
for (int i = 1; i <= z; i++) y = y * m4 % 4;
y += 4;
for (int i = 1; i <= y; i++) ans = ans * m10 % 10;
cout << ans << ENDL;
}
return 0;
}