求:3^0 + 3^1 +...+ 3^(N) mod 1000000007
Input
输入一个数N(0 <= N <= 10^9)
Output
输出:计算结果
Input示例
3
Output示例
40
思路:
解法一:等比数列求和公式
然后逆元求解。
解法二:可推得Sn = 3*Sn-1 + 1,可构造矩阵快速幂
代码1:
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
ll qmod(ll x, ll p)
{
ll ans = 1;
while(p)
{
if(p%2) ans = ans*x%mod;
x = x*x%mod;
p /= 2;
}
return ans;
}
int main(void)
{
ll n;
while(cin >> n)
printf("%lld\n", (qmod(3, n+1)-1+mod)%mod*(qmod(2, mod-2))%mod);
return 0;
}
代码2:
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
struct node
{
ll s[2][2];
node() {}
node(int a, int b, int c, int d)
{
s[0][0] = a;
s[0][1] = b;
s[1][0] = c;
s[1][1] = d;
}
};
node mul(node a, node b)
{
node t = node(0, 0, 0, 0);
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
for(int k = 0; k < 2; k++)
t.s[i][j] = (t.s[i][j]+a.s[i][k]*b.s[k][j])%mod;
return t;
}
node mt_pow(node p, int n)
{
node q = node(1, 0, 0, 1);
while(n)
{
if(n%2) q = mul(p, q);
p = mul(p, p);
n /= 2;
}
return q;
}
int main(void)
{
int n;
while(cin >> n)
{
node p = node(3, 1, 0, 1);
p = mt_pow(p, n);
printf("%d\n", (p.s[0][0]+p.s[0][1])%mod);
}
return 0;
}