ABC228_e Integer Sequence Fair
摘要
Title: ABC228_e Integer Sequence Fair
Tag: 欧拉定理、快速幂
Memory Limit: 64 MB
Time Limit: 1000 ms
Powered by:NEFU AB-IN
ABC228_e Integer Sequence Fair
-
题意
求 m^k^n
-
思路
首先要保证 gcd(m, MOD) = 1, 才能运用欧拉定理
因为MOD为质数，所以 m和MOD互质 -> m不是MOD的倍数 -
代码
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27'''
Author: NEFU AB-IN
Date: 2022-03-08 13:39:02
FilePath: \ACM\AtCoder\abc228\e.py
LastEditTime: 2022-03-08 15:43:01
'''
MOD = 998244353
def qpow(a, b, p):
res = 1
while b:
if b & 1:
res = res * a % p
b >>= 1
a = a * a % p
return res
n, k, m = map(int, input().split())
# m ^ k ^ n
if m % MOD == 0:
print(0)
exit(0)
print(qpow(m, qpow(k, n, MOD - 1), MOD) % MOD)
