非二进制回文 - Problème

#13219. 非二进制回文

Statistiques

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

对于每个从 $1$ 到 $n$ 的整数 $i$，你需要输出一个长度为 $n$ 的由小写拉丁字母组成的字符串 $s_i$。字符串 $s_i$ 必须恰好包含 $i$ 个不同的回文子串。如果两个子串作为字符串不同，则认为它们是不同的。

输入包含一个整数 $n$ ($1 \le n \le 25$)。

你需要输出 $n$ 行。对于某个 $i$，如果存在满足条件的答案，请以 “$i : s_i$” 的格式输出，其中 $s_i$ 是可能的字符串之一。否则，输出 “$i : \text{NO}$”。

样例

输入格式 1

输出格式 1

1 : NO
2 : NO
3 : abca
4 : bbca

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