当前位置：网站首页>[Luogu] p1157 combined output (DFS)

[Luogu] p1157 combined output (DFS)

2022-04-22 21:57:00 【percation】

Through the tunnel
Insert picture description here

Recursive enumerative combinatorial type of problem surface micro variant 

#include <bits/stdc++.h>
using namespace std;
const int N = 30;
int n,m;
bool st[N];
int path[N];
void dfs(int u, int start){
    
	if(u >= m){
    
		for(int i = 0; i < m; i++){
    
			printf("%3d",path[i]);
		}
		puts("");
		return ;
	} 
	
	for(int i = start; i <= n; i++){
    // Ascending  
		if(!st[i]){
    
			path[u] = i;
			st[i] = true;
			dfs(u + 1, i + 1);
			st[i] = false;
		}
	}
}
int main(){
    
	
	cin >> n >> m;
	dfs(0,1); 
	return 0;
}

版权声明
本文为[percation]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204221555022478.html

边栏推荐

猜你喜欢

随机推荐