M斐波那契数列
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2235 Accepted Submission(s): 650
Problem Description
M斐波那契数列F[n]是一种整数数列,它的定义如下:
F[0] = a
F[1] = b
F[n] = F[n-1] * F[n-2] ( n > 1 )
现在给出a, b, n,你能求出F[n]的值吗?
F[0] = a
F[1] = b
F[n] = F[n-1] * F[n-2] ( n > 1 )
现在给出a, b, n,你能求出F[n]的值吗?
Input
输入包含多组测试数据;
每组数据占一行,包含3个整数a, b, n( 0 <= a, b, n <= 10^9 )
每组数据占一行,包含3个整数a, b, n( 0 <= a, b, n <= 10^9 )
Output
对每组测试数据请输出一个整数F[n],由于F[n]可能很大,你只需输出F[n]对1000000007取模后的值即可,每组数据输出一行。
Sample Input
0 1 0 6 10 2
Sample Output
0 60
Source
Recommend
题解: 通过递推我们可以发现, F[n]的指数项是斐波那契数列, 所以我们可以通过求解得出答案. 设第n个费波那契数为f(n), 则F[n] = a^f(n-1) * b^f(n).
但是我们要求的是F[n] % 1000000007, 设mod = 1000000007, mod 是一个质数
我们可以用矩阵快速幂求得第n个费波那契数
由费马小定理 : 假设x 和 p 互质(x ^ p) % p = x % p 即 (x ^ (p - 1)) % p = 1 % p.
则
(a ^ f(n)) % mod
= a ^ (mod - 1 + (f(n) - (mod - 1))) % mod
= ((a ^ (mod - 1)) % mod) * (a^(f(n) - mod + 1)) % mod
= 1 * (a^(f(n) - mod + 1)) % mod
= a ^ (f(n) % (mod - 1)) % mod
最后用一个快速幂求解即可
#include <cstdio>
#include <cstring>
const int N = 2;
typedef long long LL;
const LL MOD = 1000000007;
struct Matrix{
LL ary[N][N];
void init() { memset(ary, 0, sizeof(ary)); }
Matrix() {init();};
};
const Matrix operator*(const Matrix & A, const Matrix & B) {
Matrix t;
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j) {
for (int k = 0; k < N; ++k)
t.ary[i][j] += A.ary[i][k] * B.ary[k][j];
t.ary[i][j] %= (MOD - 1);
}
return t;
}
const Matrix get_matrix(LL n) {
Matrix ans, tmp;
ans.ary[0][0] = ans.ary[1][1] = 1;
tmp.ary[0][0] = tmp.ary[0][1] = tmp.ary[1][0] = 1;
while (n) {
if (n & 1)
ans = ans * tmp;
tmp = tmp * tmp;
n >>= 1;
}
return ans;
}
LL quick_pow(LL a, LL b) {
LL ans = 1, tmp = a;
while (b) {
if (b & 1)
ans = (ans * tmp) % MOD;
tmp = (tmp * tmp) % MOD;
b >>= 1;
}
return ans;
}
int main() {
LL a, b, n;
while (~scanf("%lld%lld%lld", &a, &b, &n)) {
if (n == 0) {
printf("%lld\n", a % MOD);
continue;
}
Matrix mt = get_matrix(n - 1);
LL A = quick_pow((a % (MOD - 1)), mt.ary[0][1]) % MOD;
LL B = quick_pow((b % (MOD - 1)), mt.ary[0][0]) % MOD;
LL ans = (A * B) % MOD;
printf("%lld\n", ans);
}
return 0;
}