#include<iostream>
#include<cstdio>
using namespace std;
int book[12];
int box[12];
int n,k;
void dfs(int step)
{
if(step==k+1)
{
for(int i=1;i<=k;i++)
{
printf("%d ",box[i]);
}
printf("\n");
return;
}
for(int i=1;i<=n;i++)
{
if(!book[i]&&i>box[step-1])
{
box[step]=i;
book[i]=1;
dfs(step+1);
book[i]=0;
}
}
return;
}
int main ()
{
scanf("%d%d",&n,&k);
box[0]=-100;
dfs(1);
return 0;
//WHATAGOODDAYTODAY
}
SCAU 18712 递归实现组合————DFS
最新推荐文章于 2024-07-20 14:27:13 发布