mirror of
https://github.com/codeflash-ai/codeflash-internal.git
synced 2026-05-04 18:25:18 +00:00
44 lines
640 B
Python
44 lines
640 B
Python
def problem_p02715(input_data):
|
|
n, k = list(map(int, input_data.split()))
|
|
|
|
mod = 10**9 + 7
|
|
|
|
def power(a, n, mod):
|
|
|
|
bi = str(format(n, "b")) # 2進数
|
|
|
|
res = 1
|
|
|
|
for i in range(len(bi)):
|
|
|
|
res = (res * res) % mod
|
|
|
|
if bi[i] == "1":
|
|
|
|
res = (res * a) % mod
|
|
|
|
return res
|
|
|
|
D = [0] * (k + 1)
|
|
|
|
ans = 0
|
|
|
|
for i in reversed(list(range(1, k + 1))):
|
|
|
|
a = k // i
|
|
|
|
d = power(a, n, mod)
|
|
|
|
j = 1
|
|
|
|
while i * j <= k:
|
|
|
|
d -= D[i * j]
|
|
|
|
j += 1
|
|
|
|
D[i] = d
|
|
|
|
ans += (d * i) % mod
|
|
|
|
return ans % mod
|