1410221224-hd-Hat's Fibonacci
来源:互联网 发布:java开发管理系统 编辑:程序博客网 时间:2024/05/22 00:17
Hat's Fibonacci
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7857 Accepted Submission(s): 2553
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.
题目大意
这是斐波那契数的拓展。
解题思路
这一方面用到了斐波那契数列,另一方面又需要大数加减法。
错误原因
数组过大超过内存。可以将数组形式改为char型,这样可以减少四分之一的内存。
代码
#include<stdio.h>#include<string.h>char num[10000][2010];//用int型会超出内存,所以该用char型 int len[10000];//记录每个的长度 int main(){int n;int i,j,k;int a,b;for(i=1;i<10000;i++) for(j=0;j<2010;j++) num[i][j]='0';//初始化 num[1][0]='1';num[2][0]='1';num[3][0]='1';num[4][0]='1';len[1]=len[2]=len[3]=len[4]=1;a=0;for(i=5;i<10000;i++){b=0;for(j=0;j<=len[i-1];j++){b=a+num[i-1][j]-'0'+num[i-2][j]-'0'+num[i-3][j]-'0'+num[i-4][j]-'0';num[i][j]=b%10+'0';a=b/10;}//大数加减法 if(num[i][len[i-1]]!='0') len[i]=len[i-1]+1;else len[i]=len[i-1];if(len[i]>2005) break;}while(scanf("%d",&n)!=EOF){for(i=len[n]-1;i>=0;i--) printf("%c",num[n][i]);printf("\n");}return 0;}
0 0
- 1410221224-hd-Hat's Fibonacci
- Hat's Fibonacci hdu1250
- Hat's Fibonacci
- 1250 Hat's Fibonacci
- Hat's Fibonacci
- hdu1250-Hat's Fibonacci
- hdu1250-Hat's Fibonacci
- HDU1250:Hat's Fibonacci
- hdu1250 Hat's Fibonacci
- Hat's Fibonacci
- Hat's Fibonacci
- Hat's Fibonacci
- HDU1250 Hat's Fibonacci
- Hat's Fibonacci
- Hat's Fibonacci
- Hat's Fibonacci
- hdu1250 Hat's Fibonacci
- Hat's Fibonacci
- log级别
- 再议Unity 3D
- 面向接口编程详解(一)
- “互联中国梦—移动互联网时代的创新与创业”北航专场成功举行
- 网管常用网络命令
- 1410221224-hd-Hat's Fibonacci
- IO - 同步,异步,阻塞,非阻塞 (转)
- iOS framework 制作教程,这次不是静态包!!!
- 黑马程序员:Java基础——集合框架之体系概述、共性方法与迭代器
- ProgressDialog使用总结
- tiny 6410 启动挂载nfs
- CentOS查看登录日志及其它安全日志
- 高速穷尽列出任意连通图的哈密顿圈第一步
- 定位之坐标转化