题目:略
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn = 20 + 5;
int n;
int k;
char pic[maxn][maxn];
char ans[maxn][maxn];
bool dfs(int id, char ch) {
while(ans[id / n][id % n] != '.') id++;
//cout << id << endl;
//cout << n << endl;
if(id == n * n) return true;
int r = id / n;
int c = id % n;
int ec = n;
for(int i = r; i < n; i