切割 - Problème

#15570. 切割

Statistiques

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

给你两个字符串，你需要检查是否可以将第二个字符串切成三部分，使得这三部分拼接后可以得到第一个字符串。

输入格式

输入包含两个非空字符串，每个字符串各占一行。每个字符串最多包含 $5000$ 个小写英文字母。两个字符串的长度相同，且每个字母在两个字符串中出现的次数均相同。

输出格式

如果可以按照上述要求切割字符串，则输出 YES，否则输出 NO。如果输出 YES，接下来的三行应包含第二个字符串的三个部分，且按拼接成第一个字符串的正确顺序排列。这些部分不能为空。如果存在多种切割方案，输出其中任意一种即可。

样例

输入样例 1

Beast
betas

输出样例 1

YES
be
as
t

输入样例 2

Royalitem
Romeitaly

输出样例 2

NO

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0