HDOJ 1250 Hat's Fibonacci
来源:互联网 发布:超星尔雅网络通识课 编辑:程序博客网 时间:2024/05/01 22:42
1.Hat's Fibonacci
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6559 Accepted Submission(s): 2178
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.
2.源码
#include <stdio.h>#include <string.h>int main(){int i=1,j,n,jin,m,s;int a[5][260];//只用五行做空间,选一行为当前计算行。while(scanf("%d",&n)!=EOF){memset(a,0,sizeof(a));a[1][0]=a[2][0]=a[3][0]=a[4][0]=1;for(i=5;i<=n;i++){jin=0;m=i%5;for(j=0;j<260;j++){s=a[0][j]+a[1][j]+a[2][j]+a[3][j]+a[4][j]+jin-a[m][j];jin=s/100000000;//不是按照10位进位,而是按照8位一进位。a[m][j]=s%100000000;}}i=259;while(!a[n%5][i]) i--;printf("%d",a[n%5][i]);//头8位可能不足8位提前输出。i--;while(i>=0){printf("%08d",a[n%5][i]);i--;}printf("\n");//注意别忘了换行.}return 0;}
根据看到两个代码综合一下,感觉还不错。
0 0
- HDOJ 1250 Hat's Fibonacci
- HDOJ 1250 Hat's Fibonacci
- HDOJ 1250 Hat's Fibonacci
- hdoj 1250 Hat's Fibonacci【java】【水】
- ACM HDOJ 1250 (Hat's Fibonacci)
- 【大数问题】 HDOJ 1250 Hat's Fibonacci
- hdoj 1250 Hat's Fibonacci 【高精度】
- HDoj-1250-Hat's Fibonacci-大数
- ACM--Fibonacci数列大数--HDOJ 1250--Hat's Fibonacci
- 1250 Hat's Fibonacci
- HDOJ 1250 Hat's Fibonacci(大数,错了11次!!)
- HDOJ/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
- NYOJ371-机器人II
- PHP面向对象技术
- 指向临时变量的指针的返回
- RequestMapping用法
- linux c mysql 编程(上)
- HDOJ 1250 Hat's Fibonacci
- __declspec(dllexport) 和 __declspec(dllimport)
- 加载磊科336usb无线网卡驱动到s3c6410开发板中去
- linux c mysql 编程(下)
- 华为6地铁最佳路径
- 延伸正规表示法的符号意义
- 网站用户行为数据统计与分析之八:logstash与mongodb集成
- Openfire 性能优化
- ZOJ-1057 这题看的会哭出来<坑!>