题解 | 放苹果

#include<iostream>
#include<algorithm>
using namespace std;

int cache[11][11]{0};

int dfs(int m, int n) {
	n = n > m ? m : n; 
	if (n == 1) return 1;
	if (m == 0) return 1;
	if (cache[m][n] > 0) return cache[m][n];
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		ans += dfs(m - i, i); 
	}
	cache[m][n] = ans;
	return ans;
}

int main() {
	int m, n;
	cin >> m >> n;
	cout << dfs(m, n) << endl;
}