摘要：#include <iostream>#include <string.h>using namespace std;char grid[25][25];int vis[25][25];int n,m,x,y,tol;void DFS(int a,int b){ vis[a][b]=1; if(b+1<=m)//右面 { if(b+1==m) { tol++; } else { if(gri... 阅读全文

摘要：看了别人代码后才想明白的。还得多加练习搜索题！#include <iostream>using namespace std;char Map[9][9];bool place_c[9];int number_p;int tol;int n,k;bool can_place(int i,int j){ return !place_c[j]&&Map[i][j]=='#';}void DFS(int i){ if(number_p==k) { tol++; return; } if(i>=n) return; int j... 阅读全文