QOJ.ac

QOJ

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

#669. 哈希

Statistics

HAIKU 是一个由最多 50 个小写英文字母组成的字符串。对于一个 HAIKU $s$,你可以按如下方式计算其哈希值 $h$:

h = 0
for i=0,...|s|-1
h = (h * a + (s[i] - 'a' + 1)) % b

给定两个整数 $a$ 和 $b$。请构造 100 个具有相同哈希值的不同 HAIKU。

给定两个空格分隔的整数 $a$ 和 $b$ ($b \le 10^9$, $26 \le a < b$)。

输出 100 个具有相同哈希值的 HAIKU,每行一个。

样例

输入格式 1

26 52

输出格式 1

aaz
baz
caz
daz
...
zaz
aaaz
abaz
...
cuaz
cvaz

说明

打印版本的题目中省略了部分 HAIKU;完整版本已发布在比赛系统中。

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.