HiCode信息学奥赛两日一题 T11递归实现组合型枚举

#include <iostream>

using namespace std;

int path[25];
int n,m;

void dfs(int u,int start){
	if(u > m){				//当搜索层数大于m 
		for(int i = 1; i <= m; i ++){
			cout << path[i] << " ";
		}
		cout << endl;
	}else{
		for(int i = start; i <= n; i ++){	//保证一个递增的顺序选择后面的数进行枚举 所以i = start
			path[u] = i;
			dfs(u + 1,i + 1);
			path[u] = 0;
		} 
		
	} 
} 

int main(){

	cin >> n >> m;
	dfs(1,1);		//(搜索层数,搜索开始的数字)
	
	
	return 0;
}

标签：组合型,start,HiCode,dfs,int,枚举,层数,T11,path
来源： https://blog.csdn.net/weixin_39104847/article/details/116355403