include[HTML_REMOVED]
include[HTML_REMOVED]
include[HTML_REMOVED]
using namespace std;
int n;//当前数组的总长度
const int N = 16;
bool vis[N];//判断数字选还是不选
void dfs(int u) {
if (u > n) {
for (int i = 1; i <= n; i++)
if (vis[i] == true) cout << i << ” “;
cout << endl;
return;
}
else {
vis[u] = true;//先进行左树遍历
dfs(u + 1);
vis[u] = false;//再进行右树遍历
dfs(u + 1);
}
}
int main() {
cin >> n;
dfs(1);
return 0;
}