求第N个斐波那契数
eg.
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int count = 0;
int Fib(int n)
{
int a = 1;
int b = 1;
int c = 1;
while (n > 2)
{
c = a+b;
a = b;
b = c;
n--;
}
return c;
}
int main()
{
int n = 0;
scanf("%d", &n);
int ret = Fib(n);
printf("%d\n", ret);
printf("\ncount = %d\n", count);
return 0;
}
快来试试吧!
马上上手!