HDU3117 Fibonacci Numbers 【通项公式】
来源:互联网 发布:骨朵网络影视数据查询 编辑:程序博客网 时间:2024/04/30 04:11
Fibonacci Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1936 Accepted Submission(s): 759
Problem Description
The Fibonacci sequence is the sequence of numbers such that every element is equal to the sum of the two previous elements, except for the first two elements f0 and f1 which are respectively zero and one.
What is the numerical value of the nth Fibonacci number?
What is the numerical value of the nth Fibonacci number?
Input
For each test case, a line will contain an integer i between 0 and 108 inclusively, for which you must compute the ith Fibonacci number fi. Fibonacci numbers get large pretty quickly, so whenever the answer has more than 8 digits, output only the first and last 4 digits of the answer, separating the two parts with an ellipsis (“...”).
There is no special way to denote the end of the of the input, simply stop when the standard input terminates (after the EOF).
There is no special way to denote the end of the of the input, simply stop when the standard input terminates (after the EOF).
Sample Input
0123453536373839406465
Sample Output
0112359227465149303522415781739088169632459861023...41551061...77231716...7565
最小的斐波那契9位数是第40个,所以当n<40时直接输出结果。当n>=40时要分成前四位和后四位输出,后四位可以打表,循环节长度是15000(不知道咋证明的),因此打个表存起来,难点在求前四位,可以用斐波那契通项公式F(n)=(1/√5)*{[(1+√5)/2]^n - [(1-√5)/2]^n}【√5表示根号5,f0=0,f1=1】,这里有个坑,若是直接套这个公式将结果存入double中也会造成溢出。。。所以需要化简,但是式子有些复杂又不好化简,好在只需要求前4位,对精度要求不是太高,所以把(1-√5)/2这一项去掉不影响结果,令x=log10(1/sqrt(5)),y=log10((1+sqrt(5))/2);那么log10(fn)=x+n*y;然后就可以用科学计数法来求出前四位。
#include <stdio.h>#include <math.h>int fib_4[15010] = {0, 1}, fib[40] = {0, 1};const double x = log10(1.0 / sqrt(5.0));const double y = log10((1.0 + sqrt(5.0)) / 2.0);int main() {int n, i, b;double a;for (i = 2; i < 40; ++i) fib[i] = fib[i-1] + fib[i-2];for (i = 2; i <= 15000; ++i) {fib_4[i] = fib_4[i-1] + fib_4[i-2];if (fib_4[i] >= 10000) fib_4[i] -= 10000;}while (scanf("%d", &n) == 1) {if (n < 40) printf("%d\n", fib[n]);else {a = x + n * y;a -= (int)a;a = pow(10, a);printf("%d...%0.4d\n", (int)(a * 1000), fib_4[n%15000]);}}return 0;}
0 0
- HDU3117 Fibonacci Numbers 【通项公式】
- hdu3117 Fibonacci Numbers
- Fibonacci Numbers-hdu3117
- hdu3117-Fibonacci Numbers
- hdu3117-Fibonacci Numbers
- HDU3117 Fibonacci Numbers【数学】
- hdu3117 Fibonacci Numbers
- hdu3117 Fibonacci Numbers (矩阵快速幂)
- HDU3117-Fibonacci Numbers(矩阵快速幂+log)
- HDU3117 Fibonacci Numbers(矩阵快速幂)
- HDU3117 Fibonacci Numbers 求斐波那契的前后4位
- Fibonacci 通项公式
- hdu 1568 Fibonacci(Fibonacci通项公式)
- hdu 3117 Fibonacci Numbers 矩阵+斐波那契数列通项公式
- 【公式+矩阵快速幂】HDU_3117 Fibonacci Numbers
- HDU 3117 Fibonacci Numbers(Fibonacci矩阵加速递推+公式)
- Fibonacci数列的通项公式
- Fibonacci 数列通项公式推导
- MongoDB用户管理
- Android性能优化典范
- Jxl使用总结
- 基于CMOS模拟开关实现平衡混频器
- 给钓鱼邮件最致命的一击
- HDU3117 Fibonacci Numbers 【通项公式】
- Java笔记十三.常用API-Runtime、Runable、System类
- Sencha学习笔记1: Getting Started with Sencha Touch - 官方Sencha Touch入门指南
- windows操作系统下java程序使用sigar的使用问题
- hdu 1114 Piggy-Bank 完全背包
- 安卓开发笔记(二) Android使用AttributeSet自定义控件的方法
- 1007 正整数分组
- You Are All Excellent(余弦排比0~180)
- 收录一些xss漏洞过滤方法