POJ3070-Fibonacci
来源:互联网 发布:欧洲鞋子品牌 知乎 编辑:程序博客网 时间:2024/06/14 04:03
Fibonacci
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 14569
Accepted: 10260
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
0
9
999999999
1000000000
-1
Sample Output
0
34
626
6875
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:
.
思路:
裸题。。。。不想写
- POJ3070 Fibonacci
- Fibonacci(poj3070)
- POJ3070 Fibonacci
- poj3070 Fibonacci
- [POJ3070]Fibonacci
- poj3070 Fibonacci
- poj3070 Fibonacci
- poj3070 Fibonacci
- 【poj3070】 Fibonacci
- 【poj3070】Fibonacci
- 【poj3070】Fibonacci
- POJ3070-Fibonacci
- POJ3070-Fibonacci
- Fibonacci(poj3070斐波拉数)
- Fibonacci(POJ3070)
- poj3070 Fibonacci 数论专题
- 【poj3070】 Fibonacci 【矩阵乘法】
- 【poj3070】Fibonacci(矩阵)
- HDU 3348 coins【贪心】
- 9.SPL 基础接口
- python知识点(一)
- leetcode---Range Sum Query
- java基础知识
- POJ3070-Fibonacci
- 【Hibernate】多对多关联映射
- MVP模式实例:登录界面
- 进程终止分析之二
- 浅谈JavaScript原型及原型链
- inode更新mtime和ctime
- 机房收费系统总结
- 对Android初学者学习中的几点建议
- wordpress如何压缩HTML代码