HDU 6063 RXD and math+(快速幂）+多校联赛第三场

最新推荐文章于 2020-02-01 19:17:42 发布

旧时量刑

最新推荐文章于 2020-02-01 19:17:42 发布

阅读量527

点赞数

文章标签： 2017多校联赛数论

本文链接：https://blog.csdn.net/hyyjiushiliangxing/article/details/76566201

版权

RXD and math

Time 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:

\sum i = 1 n k μ 2 (i) \times ⌊ n k i - - - \sqrt ⌋

output the answer module

109+7 .

1≤n,k≤1018

μ (n) = 1 (n = 1)

μ (n) = (- 1) k (n = p 1 p 2 \dots p k)

μ (n) = 0 (o t h e r w i s e)

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

Sample Output

      
      
       
       Case #1: 999999937

Source

2017 Multi-University Training Contest - Team 3

Recommend

liuyiding | We have carefully selected several similar problems for you: 6066 6065 6064 6063 6062

官方题解

注意到一个数字

x

必然会被唯一表示成

a^2\times b

的形式.其中

|\mu(b)| = 1

。所以这个式子会把

n^k]

的每个整数恰好算一次. 所以答案就是

n^k

,快速幂即可. 时间复杂度

O(\log k)

当时做题是想的是打表，到现在，也不知道怎么推出了的，

正场比赛下来，求安慰

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
int main()
{
    long long n,k;
    int T=1;
    while(scanf("%lld%lld",&n,&k)!=EOF)
    {
        long long sum=1;
        n=n%1000000007;
        while(k)
        {
            if(k%2==0)
            {
                n=n*n%1000000007;
                k=k/2;
            }
            else
            {
                sum=(sum%1000000007)*(n%1000000007);
                sum=sum%1000000007;
                k--;
            }
        }

        printf("Case #%d: %lld\n",T++,sum);
    }
}