HDU 2070 Fibbonacci Number
来源:互联网 发布:java throws用法 编辑:程序博客网 时间:2024/04/29 19:28
Fibbonacci Number
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13400 Accepted Submission(s): 6677
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.
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
345-1
Sample Output
235you can use 64bit integer: __int64HintNote:
#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;}
0 0
- hdu 2070 Fibbonacci Number
- HDU 2070 Fibbonacci Number
- HDU 2070 Fibbonacci Number
- hdu 2070 Fibbonacci Number
- HDU 2070 Fibbonacci Number
- HDU 2070 Fibbonacci Number
- HDU-2070 Fibbonacci Number
- Hdu 2070 Fibbonacci Number
- hdu 2070 Fibbonacci Number
- HDU-2070Fibbonacci Number
- hdu 2070 递归Fibbonacci Number
- HDU 2070 Fibbonacci Number 水题
- HDU 2070 Fibbonacci Number【递推】
- 2070 Fibbonacci Number
- hdoj 2070 Fibbonacci Number
- HDUJ 2070 Fibbonacci Number
- 2070 Fibbonacci Number
- HDOJ 2070 Fibbonacci Number
- Cocos2d-x手动绑定C++类到Lua
- ShareSDK for Android 2.3.9已经发布
- (Java初级)简单的四位数加密
- HDU 2199 Can you solve this equation? 简单二分
- 【转载】高性能网络I/O框架-netmap源码分析(1)
- HDU 2070 Fibbonacci Number
- 最近的心情
- php——学习笔记,phpstorm的快捷键
- Codeforces Round #258 (Div. 2)
- hadoop 2.4.1集群搭建
- 设计模式实现(三)---装饰模式
- C# 重命名文件名and 创建文件夹、文件流
- 使用EF框架的增删改查和分页的公共类
- gvim 换行符替换