本文共 680 字,大约阅读时间需要 2 分钟。
#include #include #include #include #include #include #include #include #include #include using namespace std;int N=6;int sum=0;int visited[7][7];void dfs(int row,int colum){ if(visited[row][colum]==1) return; if(row==0||row==N||colum==0||colum==N) { sum++; visited[row][colum]=0; return; } visited[row][colum]=1; visited[N-row][N-colum]=1; dfs(row+1,colum); dfs(row-1,colum); dfs(row,colum+1); dfs(row,colum-1); visited[row][colum]=0; visited[N-row][N-colum]=0;}int main(){ memset(visited,0,sizeof(visited)); dfs(3,3); cout<
转载于:https://www.cnblogs.com/WAoyu/p/8564965.html