13.用递归的方法编写函数求Fibonacci级数,公式为Fn= Fn-1+Fn-2(n＞ 2)，F1=F2= 1观察递归调用的过程.

#include <iostream>

using namespace std;

int fib(int n);

int main()

{

int n, answer;

cout <<"Enter number: ";

cin >> n;

cout <<"\n\n";

answer = fib(n);

cout << answer <<" is the "<< n <<"th Fibonacci number\n";