AW92 递归实现指数型枚举

题目地址

---

#include<cstdio>
#include<iostream>
#include<vector>
using namespace std;
vector<int> chosen;
int n;
void dfs(int x){
	if(x==n+1){
		for(int i=0;i<chosen.size();i++)
			printf("%d ",chosen[i]);
		printf("\n");
		return;
	}
	dfs(x+1);
	chosen.push_back(x);
	dfs(x+1);
	chosen.pop_back();
}
int main(){
	scanf("%d",&n);
	dfs(1);
	return 0;
}