QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 64 MB Total points: 100

#23768. JOI 與 IOI

The problem was used in the following contests:

第7回日本情報オリンピック (JOI 2007/2008)　予選

題目描述

對於給定的字串，請編寫程式分別求出其中連續的 $3$ 個字元排列為 JOI 或 IOI 的位置各有多少處。字串僅由大寫英文字母組成。例如，在下圖所示的 JOIOIOI 中，JOI 包含在 $1$ 處，IOI 包含在 $2$ 處。

輸入格式

輸入共 $1$ 行，包含 $1$ 個長度不超過 $10000$ 的由大寫英文字母組成的字串。

輸出格式

輸出共 $2$ 行，在第 $1$ 行輸出找到的 JOI 的個數，在第 $2$ 行輸出找到的 IOI 的個數。

輸入輸出範例

輸入範例 1

JOIJOI

輸出範例 1

2
0

輸入範例 2

JOIOIOIOI

輸出範例 2

1
3

輸入範例 3

JOIOIJOINXNXJIOIOIOJ

輸出範例 3

2
3

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

No issues in this category.