題目鏈接:https://ac.nowcoder.com/acm/problem/16695
dp[i][j]表示把i劃分爲j部分的分法
狀態轉移方程:
劃分部分大於原數,無法劃分
劃分全爲1或劃分爲1部分
整數i-1劃分出一個1或整數i-j劃分出一個j
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <cstring>
using namespace std;
typedef long long ll;
static const int MAX_N = 1005;
static const ll Mod = 1e9 + 7;
static const int N = 105;
static const ll INF = (ll)1 << 60;
int dp[205][7];
int main() {
/*freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);*/
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= k; ++j) {
if (j > i) dp[i][j] = 0;
else if (i == j || j == 1) dp[i][j] = 1;
else dp[i][j] = dp[i - 1][j - 1] + dp[i - j][j];
}
}
printf("%d\n", dp[n][k]);
return 0;
}