No.1592 Tenkei 90
問題文最終更新日: 2021-07-08 23:25:03
English (AI translation)
This statement was translated by AI (claude-opus-5-5, effort medium) and may contain errors or differ in nuance from the original. The original statement takes precedence.
Back to the original
競プロ典型 90 問 期末試験
(順位表)
の他の問題:
Problem Statement
Can the string kyoprotenkei90 be obtained by appropriately rearranging the string $S$?
Input
$S$
Output
Print Yes if the string $S$ can be rearranged to form kyoprotenkei90, and No otherwise.
Constraints
- $S$ is a string of $14$ characters consisting of lowercase English letters or digits
Sample
Sample 1
Input
90kyoprotenkei
Output
Yes
The string kyoprotenkei90 can be obtained by appropriately rearranging the string 90kyoprotenkei.
Sample 2
Input
tenkei90mondai
Output
No
Sample 3
Input
cospleermusora
Output
No
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。
e869120
NASU41