hdu 1250 Hat's Fibonacci(高精度加法)
来源:互联网 发布:mac 新建智能文件夹 编辑:程序博客网 时间:2024/05/20 13:37
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1250
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.
#include <iostream>#include <cstdio>using namespace std;const int maxn=2008;char f[9000][maxn+2]; //为什么取9000?int main(){ int i=5,p=maxn,n,num; f[1][maxn]=f[2][maxn]=f[3][maxn]=f[4][maxn]=1; while(f[i-1][1]<=1){ for(int j=maxn;j>=p;j--){ f[i][j]=f[i-1][j]+f[i-2][j]+f[i-3][j]+f[i-4][j]; //****** } for(int j=maxn;j>=p;j--){ int c=f[i][j]/10; if(c>0){ f[i][j]=f[i][j]%10; f[i][j-1]+=c; } } if(f[i][p-1]>0)p--; i++; } while(cin>>n){ for(int k=0;k<=maxn;k++){ if(f[n][k]!=0){ num=k; break; } } for(int k=num;k<=maxn;k++)printf("%d",f[n][k]); puts(""); } return 0;}
0 0
- hdu 1250 Hat's Fibonacci(高精度加法)
- HDU 1250 Hat's Fibonacci(高精度加法)
- hdu 1250 Hat's Fibonacci(高精度数)
- HDU 1250 Hat's Fibonacci(高精度)
- hdu 1250 Hat's Fibonacci(高精度)
- hdu 1250 Hat's Fibonacci(高精度加法+缩进+斐波那契数)
- hdu 1250 Hat's Fibonacci(大数加法)
- HDU 1250 Hat's Fibonacci 大数加法 进位10000000
- HDU 1250 Hat's Fibonacci(递推+大数加法)
- hdoj 1250 Hat's Fibonacci 【高精度】
- hdu 1250 Hat's Fibonacci
- HDU 1250 Hat's Fibonacci
- Hdu 1250 Hat's Fibonacci
- hdu 1250 Hat's Fibonacci
- HDU 1250-Hat's Fibonacci
- hdu 1250 Hat's Fibonacci
- hdu-1250-Hat's Fibonacci
- Hdu---Hat's Fibonacci---1250
- Neutron OVS Bridge 连接方式 (veth pair / ovs peer) 的选型和性能测试
- Linux系统管理员需要知道的16个服务器监控命令
- JSP存放在 WEB-INF 跟webroot的区别
- vmware虚拟机Windows 2003上网问题
- as3.0 Function.apply()与Function.call()方法简介
- hdu 1250 Hat's Fibonacci(高精度加法)
- Oracle 11gR2 List-Range分区实验
- WPF+WinForm系统主页框架Demo(附带一些小功能!)
- Jmeter集成到Jenkins中展现html报告并发送邮件
- xtrabackup备份之初认识
- Java的反射机制
- ORACLE用户解锁
- Weblogic常见故障常:JDBC Connection Pools
- 黑马程序员--Java集合框架(1)