练习: 实现一个recursive函数 F(n), 使满足下述结果:
F(0) = 0
F(1) = 1
F(2) = 1
F(3) = 2
F(4) = 3
F(5) = 5
F(6) = 8
F(7) ? 13
#include <stdio.h> int F(int n) { if(n == 0) return 0; else if(n == 1) return 1; else return F(n - 1) + F(n - 2); } int main() { int n, x; scanf("%d", &n); x = F(n); printf("x is %d\n", x); }