#include<iostream>
#include<cstdio>
using namespace std;
int a[101], n, r;
void dfs(int depth, int prevalue)
{
if (r == depth)
{
for (int i = 0; i < r; i++)
printf("%3d", a[i]);
cout << endl;
}
else
for (int i = prevalue + 1; i <= n; i++)
{
a[depth] = i;
dfs(depth + 1, i);
}
}
int main()
{
cin >> n >> r;
dfs(0, 0);
return 0;
}
洛谷P1157 组合的输出进阶解法
最新推荐文章于 2023-05-18 08:53:48 发布