HDU 2070 Fibbonacci Number
2015-10-02 16:39
232 查看
Fibbonacci Number
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13400 Accepted Submission(s): 6677
Problem Description
Your objective for this question is to develop a program which will generate a fibbonacci number. The fibbonacci function is defined as such:
f(0) = 0
f(1) = 1
f(n) = f(n-1) + f(n-2)
Your program should be able to handle values of n in the range 0 to 50.
Input
Each test case consists of one integer n in a single line where 0≤n≤50.
The input is terminated by -1.
Output
Print out the answer in a single line for each test case.
Sample Input
3 4 5 -1
Sample Output
2 3 5 HintNote: you can use 64bit integer: __int64
#include<stdio.h> __int64 a[55]={0,1}; int main() { int i; int m; for(i=2;i<51;i++) a[i]=a[i-1]+a[i-2]; while(scanf("%d",&m)&&(m!=-1)) { printf("%I64d\n",a[m]); } return 0; }
相关文章推荐
- python-文件读取
- hdu 1429 状态搜索
- HashTable的实现原理分析
- ocp-38
- 进程间的通信(浅谈)
- ocp-37
- 【C语言】双向链表的实现
- awk 正则表达式、正则运算符详细介绍
- 大数字相加
- Ad-hoc网络
- HDU 2104 GCD
- CodeForces 415A Mashmokh and Lights
- 《zw版·delphi与halcon系列原创教程》zw版_THImagex控件函数列表
- NFS网络文件系统安装
- 关于二进制位——切记!!!
- 工作常用第三方框架
- web应用配置的logback,为什么在tomcat下没日志文件出现
- (九) HTTP/2的错误码定义
- 人才公司环境与企业文化
- UIstoryboard