//Fibonacci數(shù)列第n項(xiàng)的遞歸求解

#include <stdio.h>
int F(int n)
{
	if(n<=1) return 1;
	return F(n-1)+F(n-2);
}

void main()
{
	int n=-1;
	printf("請輸入一個非負(fù)整數(shù)n: ");
	while(n<0) scanf("%d",&n);
	printf("F(%d)= %d\n",n,F(n));
}