深搜板子加一點點修改，適合初學者體會深搜，具體看代碼
題目鏈接

ACcode

#include<bits/stdc++.h>using namespace std;int a, b;bitset<50>vis;//剪枝
int d[50];void dfs(int x) {if (x == b + 1) {for (int i = 1;i <= b;i++)cout << setw(3) << d[i];cout << '\n';return;}for (int i = x;i <= a;i++) {if (vis[i])continue;if (d[x - 1] > i)continue;//題目要求必須從小到大輸出vis[i] = 1;d[x] = i;dfs(x + 1);vis[i] = 0;d[x] = 0;}
}int main()
{ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);cin >> a >> b;dfs(1);return 0;
}