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.