1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
| #include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(0),cin.tie(0)
using namespace std;
bool maze[10][10],vis[10][10];
int ans = 0;
bool check(int x,int y){
for(int i=1;i<=8;i++){
for(int j=1;j<=8;j++){
if(vis[i][j]){
if(abs(i - x) == abs(j - y))return false;
if(i == x || j == y)return false;
}
}
}
return true;
}
void dfs(int cur){
if(cur > 8){
ans++;
return;
}
for(int i=1;i<=8;i++){
if(check(cur,i) && maze[cur][i]){
vis[cur][i] = 1;
dfs(cur+1);
vis[cur][i] = 0;
}
}
}
signed main(){
IOS;
memset(maze,0,sizeof(maze));
memset(vis,0,sizeof(vis));
for(int i=1;i<=8;i++){
string s;getline(cin,s);
for(int j=1;j<=8;j++){
if(s[j-1] == '.')maze[i][j] = 1;
}
}
dfs(1);
cout<<ans<<"\n";
}
|