GJJ的日常之沉迷数学
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 327 Solved: 41
Submit Status Web Board
Description
GJJ每天都要膜拜一发数学大佬,因为GJJ的数学太差了。这不,GJJ又遇到难题了,他想求助WJJ,但是WJJ这几天忙于追妹子,哪有时间给他讲题, 于是GJJ求助于热爱ACM的你,Acmer们能帮帮他吗?问题是求: k^0 + k^1 +...+ k^(n) mod p (0 < k < 100, 0 <= n <= 10^9, p = 1000000007)
例如:6^0 + 6^1 +...+ 6^(10) mod 1000000007 (其中k = 6, n = 10, p = 1000000007)
Input
输入测试数据有多组,每组输入两个整数k, n
Output
每组测试数据输出:Case #: 计算结果
Sample Input
2 16 10
Sample Output
Case 1: 3Case 2: 72559411
HINT
Source
等比数列+逆元的运用
#include <iostream>
#include <cstdio>
#include <cmath>
typedef long long LL;
const LL Mod = 1e9+7;
LL n , k;
LL Quickpow(LL a , LL n)
{
LL ans = 1;
while(n)
{
if ( n & 1)
{
ans = ans * a % Mod;
}
a = a * a % Mod;
n >>= 1;
}
return ans;
}
int main()
{
int d = 1;
while(~scanf("%lld %lld",&k , &n))
{
if(k == 1)
printf("Case %d: %lld\n",d++,n+1);
else
{
LL w = Quickpow(k , n+1);
w = w - 1;
LL t = Quickpow(k-1 , Mod-2);
printf("Case %d: %lld\n",d++,w * t % Mod);
}
}
return 0;
}