hdu 1250 高精度+斐波那契
来源:互联网 发布:淘宝店铺怎么设置打折 编辑:程序博客网 时间:2024/05/20 15:58
Hat's Fibonacci
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem Description
A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.
F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4)
Your task is to take a number as input, and print that Fibonacci number.
F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4)
Your task is to take a number as input, and print that Fibonacci number.
Input
Each line will contain an integers. Process to end of file.
Output
For each case, output the result in a line.
Sample Input
100
Sample Output
4203968145672990846840663646Note:No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits.
Author
戴帽子的
代码:
#include <iostream>using namespace std;const int m=2008;char data[8760][m+2];int main(){ int i=5,p=m,n,num; data[1][m]=1; data[2][m]=1; data[3][m]=1; data[4][m]=1; while(data[i-1][1]<=1) { for(int j=m;j>=p;j--) data[i][j]=data[i-4][j]+data[i-1][j]+data[i-2][j]+data[i-3][j]; for(int j=m;j>=p;j--) { int c=data[i][j]/10; if(c>0) { data[i][j]=data[i][j]%10; data[i][j-1]+=c; } } if(data[i][p-1]>0) p--; i++; } while(cin>>n) { for(int i=0;i<=m;i++) { if(data[n][i]!=0) { num=i; break; } } for(int i=num;i<=m;i++) cout<<(int)data[n][i]; cout<<endl; } return 0;}
0 0
- hdu 1250 高精度+斐波那契
- hdu 1250 高精度+类似斐波那契数列
- HDU 5686 (斐波那契数列 高精度)
- hdu 1250 Hat's Fibonacci(高精度加法+缩进+斐波那契数)
- hdu 1250 高精度加法(类斐波那契)
- hdu1316(斐波那契数列+高精度)
- HDU1250 高精度斐波那契数列
- hdu 1715 大菲波数(高精度加法+打表 + 斐波那契数)
- hdu 1316 How Many Fibs?(高精度加法+ 斐波那契数)
- hdu 1865 1sting((高精度加法+ 斐波那契数)
- hdu 1316 How many Fibs?(高精度斐波那契数)
- UVa 10334 Ray Through Glasses (斐波那契&高精度)
- UVA 10334 - Ray Through Glasses(高精度斐波那契)
- UVA 763 - Fibinary Numbers(高精度斐波那契)
- UVA 763 - Fibinary Numbers(高精度斐波那契 + 高精度模板)
- UVa 10183 How Many Fibs? (统计斐波那契数个数&高精度)
- (高精度运算4.7.30)UVA 10579 Fibonacci Numbers(大数+斐波那契数)
- UVA 10183How Many Fibs?(高精度 斐波那契)
- OC - Menory(High)
- Linux 网络配置
- 文件权限管理及ACL设置
- 黑马程序员——java复习总结——GUI和网络编程
- codeforces#316 div2
- hdu 1250 高精度+斐波那契
- centos7下安装adagios
- 谷歌技术"三宝"之谷歌文件系统
- ThreadLocal用法和实现原理
- Google后Hadoop时代的新“三驾马车”
- 华为OJ题目:24点运算
- 配置python环境
- UIAlertController用法大全
- nc命令