洛谷P1025 数的划分

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
#include<ctime>
using namespace std;
typedef long long LL;

int n, k, ans;
int f[210][10];

void xx()
{
    ans = 0;
    memset(f, 0, sizeof(f));
}

int main()
{
    scanf("%d%d", &n, &k);
    //第一问
    xx();
    for (int i = 0; i <= n; i++)
    {
        f[i][1] = 1;
        f[i][i] = 1;
    }
    for (int i = 2; i <= n; i++) {
        for (int j = 2; j <= k; j++)
        {
            f[i][j] = f[i - 1][j - 1];
            if (i - j >= j)
                f[i][j] += f[i - j][j];//简单的理解就是：如果划分有一个1，剔除为f[i-1][j-1];如果没有1，全部-1，为f[i-j][j].
        }
    }
    cout << f[n][k] << endl;
}