Date: 2019/10/11
Degree of difficulty:Universal
Original question: P1644 跳马问题
完美的开始!
这道题和八皇后有点类似,都是二维的
但是这是简单的无回溯的DFS就可!
所以无具体解析
#include<bits/stdc++.h>
using namespace std;
int movx[5]={-2,-1,1,2};
int movy[5]={1,2,2,1};
int vis[20][20],m,n,cnt;
void dfs(int x,int y){
if(x == m && y == n){cnt++;return;}
int xx,yy;
for(int i = 0; i <= 3; i ++){
xx = x+movx[i];
yy = y+movy[i];
if(xx>=0 && xx<=m && yy>=0 && yy<=n){
dfs(xx,yy);
}
}
}
int main() {
scanf("%d %d",&m,&n);
dfs(0,0);
printf("%d\n",cnt);
return 0;
}