摘要:
fibonacci数的递归求法: 1 2 struct Fib 3 { 4 int x1; 5 int x2; 6 }; 7 8 Fib fib(int x) 9 {10 Fib ans;11 if(x == 2)12 {13 ans.x... 阅读全文
摘要:
fibonacci数的递归求法: 1 2 struct Fib 3 { 4 int x1; 5 int x2; 6 }; 7 8 Fib fib(int x) 9 {10 Fib ans;11 if(x == 2)12 {13 ans.x... 阅读全文
|