一、整体思路
1、我们使用数组模拟整个棋盘
long long int re[25][25] = {0}, i, j, n, m, hourse_i, hourse_j;
n,m为卒最后到达的棋盘坐标
hourse_i, hourse_j为马所在的棋盘的坐标
2、我们需要标记卒不能到达的坐标,也就是马所在的位置以及马跳一次到达的坐标,并将其设置为-1
re[hourse_i][hourse_j] = -1;
if((hourse_i - 1) >= 0 && (hourse_j - 2) >= 0)
re[hourse_i - 1][hourse_j - 2] = -1;
if((hourse_i - 2) >= 0 && (hourse_j - 1) >= 0)
re[hourse_i - 2][hourse_j - 1] = -1;
if((hourse_i - 1) >= 0 && (hourse_j + 2) <= m)
re[hourse_i - 1][hourse_j + 2] = -1;
if((hourse_i - 2) >= 0 && (hourse_j + 1) <= m)
re[hourse_i - 2][hourse_j + 1] = -1;
if((hourse_i + 1) <= n && (hourse_j - 2) >= 0)
re[hourse_i + 1][hourse_j - 2] = -1;
if((hourse_i + 2) <= n && (hourse_j - 1) >= 0)
re[hourse_i + 2][hourse_j - 1] = -1;
if((hourse_i + 1) <= n && (hourse_j + 2) <= m)
re[hourse_i + 1][hourse_j + 2] = -1;
if((hourse_i + 2) <= n && (hourse_j + 1) <= m)
re[hourse_i + 2][hourse_j + 1] = -1;
3、re不仅为模拟棋盘,并且记录到达该点卒能走的路径个数
(1)我们假设该棋盘卒只能向下和向右走,并且没有任何阻碍。
那么对于(i, j)的坐标来说,可以从(i - 1, j)向下走或者可以从(i, j - 1)向右走.也就是在我们用来记录路径个数的re中,re[i][j] = re[i - 1][j] + re[i][j - 1]
(2)我们来思考特殊情况
初始点肯定为1
if(i == 0 && j == 0)
re[i][j] = 1;
对于任何一个马能到达的点(re[i][j] = -1),都不可以到达,所以在遇到的时候设置re[i][j] = 0即可
if(re[i][j] == -1)
re[i][j] = 0;
对于最左边一列,都只有一种走法可以到达,就是一直向下,因此均为1
if(j == 0)
re[i][j] = re[i - 1][j];
同理最上边一行也是
if(i == 0)
re[i][j] = re[i][j - 1];
二、整体代码
#include<iostream>
using namespace std;
int main() {
long long int re[25][25] = {0}, i, j, n, m, hourse_i, hourse_j;
cin>>n>>m>>hourse_i>>hourse_j;
re[hourse_i][hourse_j] = -1;
if((hourse_i - 1) >= 0 && (hourse_j - 2) >= 0)
re[hourse_i - 1][hourse_j - 2] = -1;
if((hourse_i - 2) >= 0 && (hourse_j - 1) >= 0)
re[hourse_i - 2][hourse_j - 1] = -1;
if((hourse_i - 1) >= 0 && (hourse_j + 2) <= m)
re[hourse_i - 1][hourse_j + 2] = -1;
if((hourse_i - 2) >= 0 && (hourse_j + 1) <= m)
re[hourse_i - 2][hourse_j + 1] = -1;
if((hourse_i + 1) <= n && (hourse_j - 2) >= 0)
re[hourse_i + 1][hourse_j - 2] = -1;
if((hourse_i + 2) <= n && (hourse_j - 1) >= 0)
re[hourse_i + 2][hourse_j - 1] = -1;
if((hourse_i + 1) <= n && (hourse_j + 2) <= m)
re[hourse_i + 1][hourse_j + 2] = -1;
if((hourse_i + 2) <= n && (hourse_j + 1) <= m)
re[hourse_i + 2][hourse_j + 1] = -1;
for(i = 0; i <= n; i++) {
for(j = 0; j <= m; j++) {
if(re[i][j] == -1)
re[i][j] = 0;
else {
if(i == 0 && j == 0)
re[i][j] = 1;
else if(i == 0)
re[i][j] = re[i][j - 1];
else if(j == 0)
re[i][j] = re[i - 1][j];
else
re[i][j] = re[i - 1][j] + re[i][j - 1];
}
}
}
cout<<re[n][m]<<endl;
return 0;
}