Score : $200$ points

问题描述

设一串字符串 $S$ 被称为字符串 $T$ 的子串，当存在一对整数 $i$ 和 $j$（满足 $1 \leq i \leq j \leq |T|$），且满足以下条件时。

• 从第 $i$ 个到第 $j$ 个字符不改变顺序地提取出的 $T$ 中的子序列等于 $S$。

令 $T$ 为 oxx 连接而成的重复 $10^5$ 次的字符串。
给定一个字符串 $S$，如果 $S$ 是 $T$ 的子串，则输出 Yes，否则输出 No。

以上为通义千问 qwen-max 翻译，仅供参考。

Problem Statement

A string $S$ is said to be a substring of a string $T$ when there is a pair of integers $i$ and $j$ ($1 \leq i \leq j \leq |T|)$ that satisfy the following condition.

• The extraction of the $i$-th through $j$-th characters of $T$ without changing the order equals $S$.

Let $T$ be the concatenation of $10^5$ copies of oxx.
Given a string $S$, print Yes if $S$ is a substring of $T$, and No otherwise.

Constraints

• $S$ is a string consisting of o and x.
• The length of $S$ is between $1$ and $10$ (inclusive).

Input

Input is given from Standard Input in the following format:

$S$

Output

If $S$ satisfies the condition, print Yes; otherwise, print No.

Sample Input 1

xoxxoxxo

Sample Output 1

Yes

$T$ begins like this: oxxoxxoxxoxx... Since the extraction of $3$-rd through $10$-th characters of $T$ equals $S$, $S$ is a substring of $T$, so Yes should be printed.

Sample Input 2

xxoxxoxo

Sample Output 2

No

Since there is no way to extract from $T$ a string that equals $S$, $S$ is not a substring of $T$, so No should be printed.

Sample Input 3

ox

Sample Output 3

Yes

update @ 2024/3/10 10:02:53