QOJ.ac

QOJ

実行時間制限: 2 s メモリ制限: 1024 MB

#23920. 重複字符串

統計

將 $2$ 個相同嘅字符串駁埋一齊所得到嘅字符串稱為重複字符串。

例如,OIOI、JJJJJJ、JOIOIJOIOI 係重複字符串,而 IOOI、JOIIOI 唔係重複字符串。

給定一個長度為 $N$ 嘅字符串 $S$。$N$ 係偶數,而且 $S$ 嘅每個字符都係 J、O、I 其中之一。

如果 $S$ 係重複字符串就輸出 Yes,否則輸出 No。

約束條件

  • $2 \le N \le 100$。
  • $N$ 係偶數。
  • $S$ 係長度為 $N$ 嘅字符串。
  • $S$ 嘅每個字符都係 J、O、I 其中之一。

輸入

輸入按以下格式由標準輸入給出:

N
S

輸出

如果 $S$ 係重複字符串就輸出 Yes,否則輸出 No。

範例

輸入 1

6
JOIJOI

輸出 1

Yes

說明

  • JOIJOI 可以由 $2$ 個 JOI 駁埋得到,所以佢係重複字符串。因此輸出 Yes。

輸入 2

6
IOIOIO

輸出 2

No

說明

  • IOIOIO 冇辦法由 $2$ 個相同嘅字符串駁埋得到,所以佢唔係重複字符串。因此輸出 No。

輸入 3

2
OO

輸出 3

Yes

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:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.