C++从入门到入土-递推算法

1.过河卒

代码：

#include <iostream>
#include <cstring>
#include <cstdio> 
using namespace std;
int xi[9]={0,-2,-1,1,2,2,1,-1,-2},
    yi[9]={0,1,2,2,1,-1,-2,-2,-1};
unsigned long long a[21][21],n,m,x,y,j;
bool map[21][21];
int main()
{
	freopen("knight.in","r",stdin);
	freopen("knight.out","w",stdout); 
    cin>>n>>m>>x>>y;
    for(int i=1;i<=8;i++)
    {
        if(xi[i]+x>=0&&xi[i]+x<=20&&yi[i]+y>=0&&yi[i]+y<=20)//判断边界 
            map[xi[i]+x][yi[i]+y]=1;
    }
    map[x][y]=1;
    for(int i=0;i<=20;i++)
    {
		if(map[0][i]==1)