矩阵快速幂 求Fibonacci数列poj3070
来源:互联网 发布:淘宝写教育论文靠谱吗 编辑:程序博客网 时间:2024/04/29 05:40
原作者博客地址:http://www.cnblogs.com/dongsheng/archive/2013/06/02/3114073.html
Description
In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …
An alternative formula for the Fibonacci sequence is
.
Given an integer n, your goal is to compute the last 4 digits of Fn.
Input
The input test file will contain multiple test cases. Each test case consists of a single line containing n (where 0 ≤ n ≤ 1,000,000,000). The end-of-file is denoted by a single line containing the number −1.
Output
For each test case, print the last four digits of Fn. If the last four digits of Fn are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print Fn mod 10000).
Sample Input
099999999991000000000-1
Sample Output
0346266875
Hint
As a reminder, matrix multiplication is associative, and the product of two 2 × 2 matrices is given by
.
Also, note that raising any 2 × 2 matrix to the 0th power gives the identity matrix:
.
Source
#include <cstdio> #include <iostream> using namespace std; const int MOD = 10000; struct matrix { int m[2][2]; }ans, base; matrix multi(matrix a, matrix b) { matrix tmp; for(int i = 0; i < 2; ++i) { for(int j = 0; j < 2; ++j) { tmp.m[i][j] = 0; for(int k = 0; k < 2; ++k) tmp.m[i][j] = (tmp.m[i][j] + a.m[i][k] * b.m[k][j]) % MOD; } } return tmp; } int fast_mod(int n) // 求矩阵 base 的 n 次幂 { base.m[0][0] = base.m[0][1] = base.m[1][0] = 1; base.m[1][1] = 0; ans.m[0][0] = ans.m[1][1] = 1; // ans 初始化为单位矩阵 ans.m[0][1] = ans.m[1][0] = 0; while(n) { if(n & 1) //实现 ans *= t; 其中要先把 ans赋值给 tmp,然后用 ans = tmp * t { ans = multi(ans, base); } base = multi(base, base); n >>= 1; } return ans.m[0][1]; } int main() { int n; while(scanf("%d", &n) && n != -1) { printf("%d\n", fast_mod(n)); } return 0; }
- 矩阵快速幂 求Fibonacci数列poj3070
- poj3070 Fibonacci 矩阵快速幂
- poj3070 Fibonacci 矩阵快速幂
- POJ3070 - Fibonacci - 矩阵快速幂
- POJ3070 Fibonacci(矩阵快速幂)
- poj3070 Fibonacci(矩阵快速幂)
- poj3070 Fibonacci(矩阵快速幂)
- POJ3070--Fibonacci--矩阵快速幂
- Poj3070 Fibonacci (矩阵快速幂)
- POJ3070 Fibonacci(矩阵快速幂)
- 矩阵快速幂求Fibonacci数列
- 【数论】矩阵快速幂求Fibonacci数列
- 矩阵快速幂入门 + 求Fibonacci数列
- 【poj3070】Fibonacci (矩阵乘法+快速幂)
- poj3070--Fibonacci(矩阵的快速幂)
- POJ3070 - Fibonacci (矩阵快速幂)
- poj3070 Fibonacci (矩阵快速幂)
- 【poj3070】Fibonacci——矩阵快速幂
- Topcoder SRM 547 DIV1 Level 1: Pillars
- 关于spring中aop的一个入门案例
- 去除 AutoCAD 2013 x64 教育版打印戳记
- jquery $("form").submit() 无法提交问题?
- liferay 6.1 web service 发布
- 矩阵快速幂 求Fibonacci数列poj3070
- Ubuntu 安装及配置JDK
- PHP5.3 下安装ZendGuardLoader及eaccelerator 加速器
- SMIL大作业
- Zend Guard Loader installation instructions
- 【03】for和while循环关键字,函数基本概念
- PLS-00642
- Ubuntu 下安装Eclipse及快捷方式
- Oracle 海量数据处理- 索引的选择