hdu 多校联赛 RXD and math

RXD and math

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 1832    Accepted Submission(s): 745

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=1)

μ(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
  
  

题意：如同题目所说，输入n和k求题目中的公式的结果。

这道题上去看的时候一脸懵逼 就拿着公式做文章 看看能不能拆解公式 划减一下公式 降低公式的复杂度 后来听到其他队友对公式进行打表找规律 打了100以内的数进行打表发现结果就是快速幂n^k%（10^9+7）代码如下 因为代码比较简单 就不给大家解释了

ac代码：

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int mod=1e9+7;

long long quick_multi(long long a,long long b)
{
    long long ans=0;
    while(b)
    {
        if(b&1)
        {
            ans=(ans+a)%mod;
            b--;
        }
        b>>=1;
        a=(a<<1)%mod;
    }
    return ans;
}
long long quick_mod(long long a,long long b)
{
    long long ans=1;
    while(b)
    {
        if(b&1)
        {
            ans=quick_multi(ans,a);
            b--;
        }
        b>>=1;
        a=quick_multi(a,a);
    }
    return ans;
}
int main()
{
    long long n,k;
    int ca=0;
    while(scanf("%I64d%I64d",&n,&k)!=EOF)
    {
        n%=mod;
        ca++;
    printf("Case #%d: %I64d\n",ca,quick_mod(n,k));
    }
    return 0;
}