QOJ.ac

QOJ

时间限制: 0.2 s 内存限制: 256 MB 总分: 100

#15565. Letters

统计

我们构建一个由大写字母(A-Z)组成的无限字符序列。该序列是通过将所有大写字母字符串按以下顺序拼接而成的:首先是所有单字母字符串(A, B, …, Z),接着是所有双字母字符串(AA, AB, …, AZ, BA, BB, …, BZ, …, ZZ),然后是所有三字母字符串,依此类推。相同长度的字符串按字典序排列。

我们希望求出该序列中给定索引处的字符。

输入格式

输入一个整数,表示字母的索引,范围在 $0$ 到 $2 \times 10^9$ 之间。

输出格式

输出一个大写字母,即指定索引处的字符。

样例

输入样例 1

0

输出样例 1

A

输入样例 2

25

输出样例 2

Z

输入样例 3

50

输出样例 3

A

输入样例 4

100

输出样例 4

B

输入样例 5

250

输出样例 5

E

输入样例 6

500

输出样例 6

J

输入样例 7

1000

输出样例 7

S

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.