hdu 2070 Fibbonacci Number(斐波那契数)
C语言题库
共 1080字,需浏览 3分钟
·
2021-07-31 08:14
Fibbonacci Number
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 44158 Accepted Submission(s): 19610
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
5Hint
Note:
you can use 64bit integer: __int64
代码:
#include<stdio.h>
int main()
{
long long a[55];
int i,n;
a[0] = 0;
a[1] = 1;
for(i=2;i<=50;i++)
a[i] = a[i-1]+a[i-2];
while(scanf("%d",&n)!=EOF)
{
if(n==-1)
break;
printf("%lld\n",a[n]);
}
return 0;
}
评论
斐波那契H5数据监控服务
斐波那契是业内领先的HTML5(下称H5)传播大数据分析平台,专注于研究和剖析H5的传播规律和用户画像。主要提供的服务有:1) 实时分析监测作品的传播数据和页面浏览情况,2) 描绘传播触达人群的特征,全面关注每一次的传播案例,3) 鉴别渠道优劣,帮助用户选择更有效的传播渠道。斐波那契服务的主要对象为移动营销行业客户,已接入斐波那契的品牌用户有:金蝶、恒大、百度外卖、CCTV、友金所、TCL、37游戏等; 目前已经建立深度合作和正在对接的H5平台有:兔展、未来应用、最酷、流米等; 斐波那契还面向企业用户提供全套的H5制作传播监测解决方案,目前已经建立深度合作的企业用户有:淘淘金和天道创智等。
斐波那契
0