题解 | #放苹果#

分两种情况进行讨论:

1. 有空盘
2. 无空盘

令dp[i][j]为i个盘子中放入j个苹果的方案数，则递推公式为

#include <iostream>
using namespace std;

int main() {
    

    int dp[11][11];

    for ( int i = 0; i < 11; ++i)
        dp[0][i] = 0, dp[i][0] = 1;

    for ( int i = 1; i < 11; ++i) {
        for ( int j = 1; j < 11; ++j ) {
            dp[i][j] = dp[i - 1][j];
            if (i <= j)
                dp[i][j] += dp[i][j - i];
        }
    }

    int m,n;
    cin >> m >> n;
    cout << dp[n][m];


    return 0;
}