RXD and math
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 465 Accepted Submission(s): 242
Problem Description
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
Source
注意到一个数字x必然会被唯一表示成a2×b的形式.其中∣μ(b)∣=1。 所以这个式子会把[1,nk]的每个整数恰好算一次. 所以答案就是nk,快速幂即可. 时间复杂度O(logk).
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
#define ms(a,b) memset(a,b,sizeof(a))
#define maxn 510
const int M=1e5+10;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
const double eps=1e-10;
ll n,m;
ll k;
ll quickpow(ll a,ll b)
{
ll t=a%mod;
ll ans=1;
while(b){
if(b&1)ans=ans*t%mod;
t=t*t%mod;
b>>=1;
}
return ans%mod;
}
int main()
{
int cas=1;
while(~scanf("%lld%lld",&n,&k))
{
printf("Case #%d: %lld\n",cas++,quickpow(n,k));
}
return 0;
}