Fibbonacci Number
来源:互联网 发布:淘宝企业店铺认证复核 编辑:程序博客网 时间:2024/05/14 12:40
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:注意:__int64的用法,以及怎样的输入输出;#include<iostream>#include<cstdio>using namespace std;int main(){__int64 s[100];int n,i;while(scanf("%d",&n)!=EOF){if(n==-1)break;s[0]=0;s[1]=1;s[2]=1;for(int i=3;i<=n;++i){s[i]=s[i-1]+s[i-2];}printf("%I64d\n",s[n]);}return 0;}
0 0
- Fibbonacci Number
- Fibbonacci Number
- 2070 Fibbonacci Number
- hdoj 2070 Fibbonacci Number
- hdu 2070 Fibbonacci Number
- HDU 2070 Fibbonacci Number
- HDUJ 2070 Fibbonacci Number
- 2070 Fibbonacci Number
- HDU 2070 Fibbonacci Number
- hdu 2070 Fibbonacci Number
- hdoj2070 Fibbonacci Number
- hdu2070 Fibbonacci Number
- HDOJ 2070 Fibbonacci Number
- HDU 2070 Fibbonacci Number
- hd 2070 Fibbonacci Number
- Fibbonacci Number(2070)
- hduoj2070(Fibbonacci Number)
- HDU 2070 Fibbonacci Number
- linux中强大且常用命令:find、xargs、grep
- mac下安装前端模板引擎Jinja2
- java学习--集合框架(4)
- 从Hadoop 安全机制原理到当今主流安全机制
- Java中的SPI(Service Provider Interface)介绍及示例
- Fibbonacci Number
- java生成一定范围随机数
- Using EGL with GTK+
- Double Check Locking -- Java并发
- Linq语法新特性
- 使用Eclipse的几个必须掌握的快捷方式
- hive join
- iOS开发 粗解UIDynamicAnimator
- 海康、大华IpCamera RTSP地址和格式 播放