【蓝桥杯-七段码】

//AC code
#include<bits/stdc++.h>
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define deb3(x, y, z) cout << #x << "=" << x << "," << #y << "=" << y <<","<< #z << "=" << z << endl
#define deb4(x, y, z, w) cout << #x << "=" << x << "," << #y << "=" << y <<","<< #z << "=" << z << ","<< #w << "=" << w << endl
#define debv(v) for(auto x:v) cout<<x<<" "
#define gg exit(0);

using namespace std;
const int N = 10;
int use[N], ans, e[N][N], fa[N];
int cnt = 0;
void init(){
	/*	
		连边建图，e[i][j] == 1表示第i段和第j段灯管相邻
		a b c d e f g
		1 2 3 4 5 6 7
	*/
	e[1][2] = e[1][6] = 1;
	e[2][1] = e[2][7] = e[2][3] = 1;
	e[3][2] = e[3][4] = e[3][7] = 1;
	e[4][3] = e[4][5] = 1;
	e[5][4] = e[5][6] = e[5][7] = 1;
	e[6][1] = e[6][5] = e[6][7] = 1;
	e[7][2] = e[7][3] = e[7][5] = e[7][6] = 1;
}
int find(int u){if(fa[u] == u)return u; fa[u] = find(fa[u]); return fa[u];}//并查集
void dfs(int d){
	if(d > 7){
		/* 并查集判是否在同一集合 */
		for(int i = 1;i <= 7;i++)fa[i] = i;//初始化父亲集合
		for(int i = 1;i <= 7;i++)//遍历所有边集
		for(int j = 1;j <= 7;j++)
			if(e[i][j] && use[i] && use[j]){//i和j相邻并且都亮着
				int fx = find(i),fy = find(j);
				if(fx != fy)fa[fx] = fy;//如果不在同一集合,合并
			}
		
		for(int i = 1; i <= 7; i ++)
		{
		    if(!use[i]) cout << i << ' ';
		}
		cnt ++;
		cout << endl;
		int k = 0;
		for(int i = 1;i <= 7;i++)
			if(use[i] && fa[i] == i)k++;
		
		if(k == 1)ans++;//如果所有亮灯都属于同一个集合
		return;
	}
	use[d] = 1;//打开d这个灯，继续开关下一个灯
	dfs(d + 1);
	use[d] = 0;//关闭d这个灯，继续开关下一个灯
	dfs(d + 1);
}
int main(){
	init();
	dfs(1);
	cout << ans <<endl;
	cout << cnt << endl;
}

对于每一种开关都有 开 关 两种状态, 所以枚举的也就是 2**7, 128种