C++ 代码
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N =30;
int n,m;
int way[N];
void dfs(int u,int state)
{
if(u==m+1){
for(int i=1;i<=m;i++){printf("%d ",way[i]);}
puts("");return;
}
for(int i=state;i<=n;i++){way[u]=i;dfs(u+1,i+1);way[u]=0;}
}
int main(){
scanf("%d%d",&n,&m);
dfs(1,1);
return 0;
}