【OJ】放苹果

思路：递归。

 1 #include <iostream>
 2 using namespace std;
 3 int func_apple(int x, int y){
 4     if (x == 1 || x == 0 || y == 1)
 5         return 1;
 6     if (x < y)
 7         return func_apple(x, x);
 8     return func_apple(x, y - 1) + func_apple(x - y, y);
 9 }
10 int main(){
11     int t, m, n;
12     cin >> t;
13     for (int i = 0; i < t; ++i){
14         cin >> m >> n;
15         cout << func_apple(m, n) << endl;
16     }
17     return 0;
18 } 

 

转载于:https://www.cnblogs.com/victorique-de-blois/p/11592409.html