HDU 6063 RXD and math+(快速冪)+多校聯賽第三場
阿新 • • 發佈:2019-01-03
RXD and mathTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 416 Accepted Submission(s): 210 Problem Description 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= μ(n)=(−1)k(n=p1p2…pk) μ(n)=0(otherwise) p1,p2,p3…pk are different prime numbers Input 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. Output For each test case, output "Case #x: y", which means the test case number and the answer. Sample Input 10 10 Sample Output Case #1: 999999937 Source Recommend liuyiding | We have carefully selected several similar problems for you: 注意到一個數字x必然會被唯一表示成a2×b的形式.其中∣μ(b)∣=1。 所以這個式子會把[1,nk]的每個整數恰好算一次. 所以答案就是nk,快速冪即可. 時間複雜度O(logk). 當時做題是想的是打表,到現在,也不知道怎麼推出了的, 正場比賽下來,求安慰
|