本递归的介绍，用斐波那契数列举例 his recursive introduction uses Fibonacci sequence as an example
`
#include [HTML_REMOVED]
using namespace std;
int n; 此处的n指斐波那契数列想求的第n个数
int f(int n){
if(n <= 2){
return 1;
}
else{
return f(n) + f(n-1);
}
}
int main(){
cin >> n;
cout << f(n);

  return 0;

}

`