杭电 2070 Fibbonacci Number
来源:互联网 发布:盛科网络 营收 编辑:程序博客网 时间:2024/06/05 02:42
Fibbonacci Number
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21318 Accepted Submission(s): 9943Problem DescriptionYour 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.InputEach test case consists of one integer n in a single line where 0≤n≤50. The input is terminated by -1.OutputPrint out the answer in a single line for each test case.Sample Input345-1Sample Output235you can use 64bit integer: __int64HintNote:AuthorLilySource浙江工业大学网络选拔赛
#include<stdio.h>__int64 f[100]={0,1}; //这里注意位置,要不然也不行 int main(){ int n,i; while(~scanf("%d",&n),n!=-1) { for(i=2;i<=n;i++)//要能等于i才行!!!! f[i]=f[i-1]+f[i-2]; printf("%I64d",f[n]); } return 0;}
0 0
- Fibbonacci Number(杭电2070)
- 【杭电】[2070]Fibbonacci Number
- 杭电 2070 Fibbonacci Number
- 杭电ACM 2070:Fibbonacci Number
- 杭电(hdu)2070 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
- HDOJ 2070 Fibbonacci Number
- HDU 2070 Fibbonacci Number
- hd 2070 Fibbonacci Number
- Fibbonacci Number(2070)
- HDU 2070 Fibbonacci Number
- 你不知道的Java学习笔记20-- 多线程编程
- 1002
- 操作系统
- C 菜单浏览
- Android开发中的Tips
- 杭电 2070 Fibbonacci Number
- 关于数学。
- 关于矩阵表示(matrix-based expression)
- Tcc学习笔记(一) 开篇
- Angular学习心得之directive——require选项的细节
- Linux信号总结
- Apache与Nginx的优缺点比较
- HDU1237-简单计算器
- uva225 回溯剪枝