CODEVS 1219骑士游历

#include<stdio.h>
#include<iostream>
using namespace std;
int n,m,x1,x2,y1,y2;
long long f[55][55];
long long d(int i,int j){
    long long a=0,b=0,c=0,dd=0;
    if(f[i][j]>0) return f[i][j];
    else if(i==x2&&j==y2) return 1;
    else {
        if(i+1<=x2&&j+2<=m) a=d(i+1,j+2);
        if(i+1<=x2&&j-2>=1) b=d(i+1,j-2);//j-2>=1从(1,1)开始！！！注意边界不是(0,0)...
        if(i+2<=x2&&j+1<=m) c=d(i+2,j+1);
        if(i+2<=x2&&j-1>=1) dd=d(i+2,j-1);//j-1>=1从(1,1)开始！！！注意边界不是(0,0)...
        return f[i][j]=a+b+c+dd;
    }
}
int main(){
    freopen("1219.in","r",stdin);
    freopen("1219.out","w",stdout);
    cin>>n>>m;
    cin>>x1>>y1>>x2>>y2;
    cout<<d(x1,y1);
    return 0;
}

题解：应该估测题目输出数据大小，本题必须用long long。记忆化搜索。