斐波那契数列
2015-04-06 18:33 jianglg3 阅读(203) 评论(0) 编辑 收藏 举报在数学上,斐波那契数列(Fibonacci Sequence),是以递归的方法来定义:
F0 = 0
F1 = 1
Fn = Fn - 1 + Fn - 2
用文字来说,就是斐波那契数列由0和1开始,之后的斐波那契数就由之前的两数相加。首几个斐波那契数是:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946,………………
#include <stdio.h>
int main()
{ int sum=0;
int sum_1,sum_2;
int sum_11=0,sum_22=1;
int i,n;
while(scanf("%d",&n)==1)
{ if(n<2)
{ if(n==0)
sum = sum_11;
else sum = sum_22;
}
else
for(sum_1=0,sum_2=1,i=0;i<n-1;i++)
{ sum = sum_1 + sum_2;
sum_1 = sum_2;
sum_2 = sum;
}
printf("%d\n",sum);
}
return 0;
}