Iroha and a Grid(AtCoder

编程入门 行业动态 更新时间:2024-10-05 03:18:52

<a href=https://www.elefans.com/category/jswz/34/1769559.html style=Iroha and a Grid(AtCoder"/>

Iroha and a Grid(AtCoder

题目描述
We have a large square grid with H rows and W columns. Iroha is now standing in the top-left cell. She will repeat going right or down to the adjacent cell, until she reaches the bottom-right cell.
However, she cannot enter the cells in the intersection of the bottom A rows and the leftmost B columns. (That is, there are A×B forbidden cells.) There is no restriction on entering the other cells.
Find the number of ways she can travel to the bottom-right cell.
Since this number can be extremely large, print the number modulo 109+7.

Constraints
1≤H,W≤100,000
1≤A<H
1≤B<W

输入
The input is given from Standard Input in the following format:

H W A B

输出
Print the number of ways she can travel to the bottom-right cell, modulo 109+7.

样例输入
2 3 1 1

样例输出
2

提示

更多推荐

Iroha and a Grid(AtCoder

本文发布于:2024-02-28 11:36:58,感谢您对本站的认可!
本文链接:https://www.elefans.com/category/jswz/34/1769555.html
版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。
本文标签:Iroha   Grid   AtCoder

发布评论

评论列表 (有 0 条评论)
草根站长

>www.elefans.com

编程频道|电子爱好者 - 技术资讯及电子产品介绍!