$10$ 分代码

#include <bits/stdc++.h>
using namespace std;
int n, sum, a[20], c[20][20];
bool flag, b[20];
void dfs(int p, int s)
{
    if (s > sum) return;
    if (p > n)
    {
        if (s == sum)
        {
            for (int i = 1; i <= n; i++) cout << a[i] << " ";
            exit(0);
        }
        return;
    }
    for (a[p] = 1; a[p] <= n; a[p]++) if (!b[a[p]])
    {
        b[a[p]] = 1;
        dfs(p + 1, s + a[p] * c[a[p]][p]);
        b[a[p]] = 0;
    }
}
int main()
{
    cin >> n >> sum;
    c[1][1] = 1;
    for (int i = 2; i <= n; i++) for (int j = 1; j <= i; j++) c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
    dfs(1, 0);
    return 0;
}