递归实现组合型枚举
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int n,m;
const int N = 30;
int way[N];
void dfs(int u,int start)
{
if(u == m + 1)
{
for(int i = 1;i < m+1;i++) printf("%d ",way[i]);
puts(" ");
return;
}
for(int i = start;i <= n;i++)
{
way[u] = i;
dfs(u + 1,i + 1);
way[u] = 0;
}
}
int main()
{
cin>>n>>m;
dfs(1, 1);
return 0;
}