QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 32 MB Total points: 10 Difficulty: [show]

#13511. Kamil

統計

题目描述

有些孩子无法发出所有字母的音,有些孩子则有时能正确发音,有时不能。Kamil 有时会把 K 说成 T,但从来不会把 T 说成 K。类似地,他有时会把 G 说成 D。另外,他有时会把 R 说成 L,有时又会说成 F。当然,有时他也会把字母读对。

Kamil 的爸爸总是在想,他儿子说出的这个“词”可能对应多少个不同的真实单词(他不考虑这些是否是波兰语中的正确单词)。

任务

编写一个程序,使其:

  • 从标准输入读入 Kamil 说出的内容;
  • 计算它可能表示多少个不同的单词;
  • 将结果输出到标准输出。

输入格式

输入只有一行,包含一个非空单词,即 Kamil 说出的单词。为简化起见,假设该单词只由英文大写字母组成,且长度不超过 20。

输出格式

你的程序应当(向标准输出)输出仅一行,其中只包含一个整数,等于 Kamil 说出的单词可能表示的不同单词数量。

样例数据

输入

FILIPEK

输出

4

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.