（洛谷）P1002 [NOIP2002 普及组] 过河卒

song~~

已于 2024-08-29 15:18:33 修改

阅读量97

点赞数 2

文章标签： java 算法数据结构

于 2024-08-29 15:17:59 首次发布

本文链接：https://blog.csdn.net/Dehdhehd/article/details/141679659

版权

#include <bits/stdc++.h>
#define ll long long
inline int read(){
    int num = 0; char c = getchar();
    while(!isdigit(c)) c = getchar();
    while(isdigit(c)) num = (num << 1) + (num << 3) + (c ^ '0'), c = getchar();
    return num;
}
int bx, by, mx, my;
ll f[30];
inline bool check(int x, int y) {
    if(x == mx && y == my) return 1;
    return (std::abs(mx - x) + std::abs(my - y) == 3) && (std::max ((std::abs(mx - x)), std::abs(my - y)) == 2);
}
int main(){
    bx = read() + 2, by = read() + 2, mx = read() + 2, my = read() + 2;
    f[2] = 1;
    for(int i = 2; i <= bx; i++){
        for(int j = 2; j <= by; j++){
            if(check(i, j)){
                f[j] = 0;
                continue;
            }
            f[j] += f[j - 1];
        }
    }
    printf("%lld\n", f[by]);
    return 0;
}