第十一届蓝桥杯省赛第五题 七段码
#include<bits/stdc++.h>
using namespace std;
char c[8] = {0,'1','2','3','4','5','6','7'};
int ans = 0;
int a[7][7];
queue<int> q;
void init()
{
a[1][2] = 1;
a[1][6] = 1;
a[2][1] = 1;
a[2][3] = 1;
a[2][7] = 1;
a[3][4] = 1;
a[3][7] = 1;
a[3][2] = 1;
a[4][3] = 1;
a[4][5] = 1;
a[5][4] = 1;
a[5][6] = 1;
a[5][7] = 1;
a[6][1] = 1;
a[6][5] = 1;
a[6][7] = 1;
a[7][2] = 1;
a[7][6] = 1;
a[7][3] = 1;
a[7][5] = 1;
}
void dfs(int index,string s)
{
if(index==7){
if(s==""){
return;
}
if(s.length()==1){
ans++;
return;
}
vector<int> v;
vector<int> t;
for(int i = 0;i<s.length();i++){
v.push_back(int(s[i]-'0'));
t.push_back(0);
}
q.push(v[0]);
t[0] = 1;
while(1)
{
int tmp = q.front();
for(int i = 0;i<v.size();i++){
if(t[i]==0){
if(a[tmp][v[i]]==1){
t[i] = 1;
q.push(v[i]);
}
}
}
q.pop();
if(q.empty()){
int flag = 1;
for(int i = 0;i<t.size();i++){
if(t[i] != 1){
flag = 0;
break;
}
}
if(flag){
ans++;
}
return;
}
}
}
dfs(index+1,s+c[index+1]);
dfs(index+1,s);
}
int main()
{
init();
dfs(0,"");
cout<<ans<<endl;
return 0;
}