[程式演算法] 1, 1, 2, 3, 5, 8...，要你求出第n項的值，分別用遞迴和迭代

B = 1

A = 1

1, 1, 2, 3, 5, 8

N = ??

N = 0

F(N)

F(0) = 0

F(1) = 1

F(2) = 2

F(3) =  F(1) + F(2) 

F(4) =  F(2) + F(3) 

#include <stdio.h>

long F(long n)

{

 if(n<=2) return 1;

 return F(n-1)+F(n-2);

}

void main()

{

 long n;

 scanf("%ld",&n);

 printf("%ld", F(n));

}