链接:http://acm.hdu.edu.cn/showproblem.php?pid=6063
Problem Description
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
莫比乌斯反演 , 他们 说小学奥赛都学过 ,但我 没发处理那个阶乘,
所以 就10^10 mod 1e9+7 发现 刚好等于答案 ,然后 就开始了 暴力之路 。
但要注意2点 , 阶乘用 快速幂 别傻傻的for循环, 就是每次* 的前后 和开始都要取模
代码:
#include<bits/stdc++.h>
#define mod 1000000007
//#define mod 1e9+7
using namespace std;
long long pow(long long a,long long b)
{
long long int ans = 1,base = a;
while(b!=0)
{
if(b&1){
base%=(long long)mod;
ans%=(long long)mod;
ans *= base;
ans%=(long long)mod;
}
base%=(long long)mod;
base *= base;
base%=(long long)mod;
b>>=1;
}
return ans;
}
int main()
{
long long int n,k;
int t=0;
while(~scanf("%lld %lld",&n,&k)){
t++;
printf("Case #%d: ",t);
printf("%lld\n",pow(n,k));
}
return 0;
}
顺便附上 整数快速幂 讲解:
http://blog.csdn.net/changjiale110/article/details/76467887