Files
python/TangDou/LanQiaoBei/LanQiaoBeiWhitePaper/18_nShuSum.cpp
HuangHai 1f397eca87 'commit'
2025-08-30 18:35:01 +08:00

32 lines
588 B
C++

#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> a;
int sum;
int cnt;
void dfs(int step, int start) {
if (step == n + 1) {
if (sum == m) {
for (int i = 0; i < a.size(); i++) printf("%d ", a[i]);
printf("\n");
cnt++;
}
return;
}
for (int i = start; i < m; i++) {
a.push_back(i);
sum += i;
dfs(step + 1, i);
sum -= i;
a.pop_back();
}
}
int main() {
cin >> n >> m;
dfs(1, 1);
printf("%d", cnt);
return 0;
}