24/02/29总结

ac:

#include<iostream>
#include<algorithm>
using std::cin;
using std::cout;
using std::endl;
const int fx[] = { 0, -2, -1, 1, 2, 2, 1, -1, -2 };
const int fy[] = { 0, 1, 2, 2, 1, -1, -2, -2, -1 };
int bx, by, mx, my;
long long f[2][40];
bool s[40][40];
int main() {
    cin >> bx >> by >> mx >> my;
    bx += 2; by += 2; mx += 2; my += 2;
    f[1][2] = 1;
    s[mx][my] = 1;
    for (int i = 1; i <= 8; i++)
    s[mx + fx[i]][my + fy[i]] = 1;
    for (int i = 2; i <= bx; i++) {
        for (int j = 2; j <= by; j++) {
            if (s[i][j]) {
                f[i & 1][j] = 0;
                continue;
            }
            f[i & 1][j] = f[(i - 1) & 1][j] + f[i & 1][j - 1];
        }
    }
    cout << f[bx & 1][by];
}