代码如下

#include <iostream>

using namespace std;

const int MAX_N = 201;
const int MAX_K = 7;
int dp[MAX_N][MAX_K] = { 0 };

int main()
{
	int n, k;
	cin >> n >> k;

    for (int i = 1; i <= n; i++) 
    {
        dp[i][1] = 1;
    }

    for (int i = 2; i <= n; i++) 
    {
        for (int j = 2; j <= k; j++) 
        {
            dp[i][j] = dp[i - 1][j - 1] + dp[i - j][j];
        }
    }

    cout << dp[n][k] << endl;
    return 0;
}