#include <iostream>
#include <iomanip>
using namespace std;
int n, m;
int ans[50];
void dfs(int len)
{
if (len == m + 1)
{
for (int i = 1; i < m; i++)
cout << ans[i] << " ";
cout << ans[m] << "\n";
return;
}
for (int i = ans[len - 1] + 1; i <= n - (m - len); i++)
{
ans[len] = i;
dfs(len + 1);
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> n >> m;
dfs(1);
return 0;
}
本题 WA 记录:https://www.luogu.com.cn/record/221236537
双倍经验 AC 记录:https://www.luogu.com.cn/record/221236684
已经被折磨半个上午搞红温了,是数据的锅吗?