AcWingDFS(小金鱼)

#include <iostream>

using namespace std;

const int N = 10;
int n;
int st_x[N] = { 2 };//0是没选中 1是选中 2是不定

void dfs_x(int u)
{
	if (u > n)
	{
		for (int i = 1;i <= n;i++)
		{
			if (st_x[i] == 1)printf("%d ", i);
		}
		cout << endl;
		return;
	}
	//不选
	st_x[u] = 0;
	dfs_x(u + 1);
	st_x[u] = 2;//恢复现场

	//选中
	st_x[u] = 1;
	dfs_x(u + 1);
	st_x[u] = 2;//恢复现场
}

int main()
{
    cin >> n;
    dfs_x(1);
    return 0;
}