Score: $200$ points

问题陈述

有一个无限长的钢琴键盘。在这个键盘中是否存在一个连续的段落，由 $W$ 个白键和 $B$ 个黑键组成？

设 $S$ 为由字符串 wbwbwwbwbwbw 无限重复形成的字符串。

是否存在一个 $S$ 的子串，由 $W$ 个 w 和 $B$ 个 b 组成？

$S$ 的子串是什么？$S$ 的子串是一个字符串，它可以通过将 $S$ 的第 $l$ 个、$(l+1)$ 个、$\dots$、第 $r$ 个字符按顺序连接起来形成，其中 $l$ 和 $r$ 是两个正整数，且 $l\leq r$。

以上为大语言模型 kimi 翻译，仅供参考。

Problem Statement

There is an infinitely long piano keyboard. Is there a continuous segment within this keyboard that consists of $W$ white keys and $B$ black keys?

Let $S$ be the string formed by infinitely repeating the string wbwbwwbwbwbw.

Is there a substring of $S$ that consists of $W$ occurrences of w and $B$ occurrences of b?

What is a substring of $S$? A substring of $S$ is a string that can be formed by concatenating the $l$-th, $(l+1)$-th, $\dots$, $r$-th characters of $S$ in this order for some two positive integers $l$ and $r$ $(l\leq r)$.

Constraints

• $W$ and $B$ are integers.
• $0\leq W,B \leq 100$
• $W+B \geq 1$

Input

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

$W$ $B$

Output

If there is a substring of $S$ that consists of $W$ occurrences of w and $B$ occurrences of b, print Yes; otherwise, print No.

Sample Input 1

3 2

Sample Output 1

Yes

The first $15$ characters of $S$ are wbwbwwbwbwbwwbw. You can take the $11$-th through $15$-th characters to form the string bwwbw, which is a substring consisting of three occurrences of w and two occurrences of b.

Sample Input 2

3 0

Sample Output 2

No

The only string consisting of three occurrences of w and zero occurrences of b is www, which is not a substring of $S$.

Sample Input 3

92 66

Sample Output 3

Yes

update @ 2024/5/16 17:17:46