RXD is a good mathematician.
One day he wants to calculate:
output the answer module 109+7 .
1≤n,k≤1018
p1,p2,p3…pk are different prime numbers
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 .
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,直接快速幂即可
#include<map>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<string>
#include<cstring>
#include<cassert>
#include<iostream>
#include<algorithm>
using namespace std;
long long mod=1000000007;
inline long long power(long long x,long long y)
{
x%=mod;
long long t=1;
while(y>0)
{
if(y%2==1)
t=t*x%mod;
x=x*x%mod;
y/=2LL;
}
return t;
}
int main()
{
long long n,k;
int kk=0;
while(scanf("%lld%lld",&n,&k)!=EOF)
{
kk++;
long long i;
long long xt=power(n,k);
printf("Case #%d: %lld\n",kk,xt);
}
return 0;
}