马拦过河卒

#include<bits/stdc++.h>
using namespace std;
long long f[25][25];
bool g[25][25];
int main() {
    int x1, y1, x2, y2; 
    scanf("%d %d", &x1, &y1);
    scanf("%d %d", &x2, &y2);
    g[x2][y2] = 1;
    if(x2 > 1 and y2 != 0)   g[x2 - 2][y2 - 1] = 1;
    if(x2 < 19 and y2 != 0)  g[x2 + 2][y2 - 1] = 1;
    if(x2 > 1 and y2 != 20)  g[x2 - 2][y2 + 1] = 1;
    if(x2 < 19 and y2 != 20) g[x2 + 2][y2 + 1] = 1;
    if(x2 != 0 and y2 > 1)   g[x2 - 1][y2 - 2] = 1;
    if(x2 != 0 and y2 < 19)  g[x2 - 1][y2 + 2] = 1;
    if(x2 != 20 and y2 > 1)  g[x2 + 1][y2 - 2] = 1;
    if(x2 != 20 and y2 < 19) g[x2 + 1][y2 + 2] = 1;
    for(int i = 0; i <= x1; ++i) 
        for(int j = 0; j <= y1;