Responsive image

问题 H: RXD and math

问题 H: RXD and math

时间限制: 2 Sec  内存限制: 128 MB
提交: 30  解决: 24
[提交][状态][讨论版][命题人:]

题目描述

RXD is a good mathematician.
One day he wants to calculate:
∑i=1nkμ2(i)×⌊nki−−−√⌋

output the answer module 109+7.
1≤n,k≤1018
μ(n)=1(n=1)

μ(n)=(−1)k(n=p1p2…pk)

μ(n)=0(otherwise)

p1,p2,p3…pk are different prime numbers

输入描述

There are several test cases, please keep reading until EOF.
There are exact 10000 cases.
For each test case, there are 2 numbers n,k.

输出描述

For each test case, output "Case #x: y", which means the test case number and the answer.

样例输入

10 10

样例输出

Case #1: 999999937
[提交][状态]
ACM算法攻关部