菲波那契数列定义为: f(1) = 1; f(2) = 1; 当n>2时, f(n) = f(n-1) + f(n-2)。求菲波那契数列的第n项。
#include<stdio.h>
int main()
{
int i, n, s;
int n1 = 0, n2 = 1;
scanf_s("%d",&n);
if(n == 1)
{
s= 1;
printf("%d\n",s);
return0;
}
for(i = 2; i <= n; i++)
{
s= n1 + n2;
n1= n2;
n2= s;
}
printf("%d\n",s);
return0;
}