hdu--6063 RXD and math

最新推荐文章于 2018-07-19 09:14:06 发布

scorpio_j

最新推荐文章于 2018-07-19 09:14:06 发布

阅读量231

点赞数

分类专栏：数学找规律文章标签：数学

本文链接：https://blog.csdn.net/scorpio_j/article/details/76652619

版权

数学同时被 2 个专栏收录

4 篇文章 0 订阅

订阅专栏

找规律

3 篇文章 0 订阅

订阅专栏

题目：hdu–6063

RXD and math

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 ⌋

$\sum_{i = 1}^{n^k}{\mu^2(i) \times \lfloor \sqrt{\frac{n^k}{i}} \rfloor}$
output the answer module

109+7 $10^9+7$ .

1≤n,k≤1018 $1\leq n, k\leq 10^{18}$

μ (n) = 1 (n = 1)

$\mu(n) = 1 (n = 1)$

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

$\mu(n) = (-1)^k (n = p_1p_2\dots p_k)$

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

$\mu(n) = 0(otherwise)$

p1,p2,p3…pk $p_1,p_2,p_3\dots p_k$ 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 $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

如果能找到规律的话，那就很快就写出来了
其实 n的k 次方对1e9+7取模就行了
代码：

#include<iostream>
#include<cstdio>
using namespace std;
long long mod = 1e9+7;
 //使用快速幂
long long pow(long long  n,long long  m){
    long long r=1,base=(n%mod);
    while(m){
        if(m&1){
            r=(r*base%mod+mod)%mod;
        }
        base=(base*base%mod+mod)%mod;
        m>>=1;
    }   
    return r;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    long long n,m,k=0;
    while(cin>>n>>m){
        printf("Case #%lld: %lld\n",++k,pow(n,m)%mod);
    }
}