QOJ.ac

QOJ

Limite de temps : 1.0 s Limite de mémoire : 512 MB Points totaux : 100 Hackable ✓

#7049. 62进制

Statistiques

众所周知,base64 是一种常见的二进制到文本的编码方案。在这里,我们定义了一系列特殊的进位制,使用 2 到 62 之间的基数(即 radix)。符号 ‘0’ – ‘9’ 表示 0 到 9,‘A’ – ‘Z’ 表示 10 到 35,‘a’ – ‘z’ 表示 36 到 61。现在你需要将一个以 $x$ 为基数的整数 $z$ 转换为以 $y$ 为基数的表示。

输入格式

输入包含三个整数 $x, y$ ($2 \le x, y \le 62$) 和 $z$ ($0 \le z < x^{120}$),其中整数 $z$ 以 $x$ 进制给出。

输出格式

输出 $z$ 的 $y$ 进制表示。

样例

样例输入 1

16 2 FB

样例输出 1

11111011

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.