【题解】poj1220 NUMBER BASE CONVERSION 高精度+进位计数制

最新推荐文章于 2021-08-04 19:25:32 发布

wwt9b15bs

最新推荐文章于 2021-08-04 19:25:32 发布

阅读量263

点赞数

CC 4.0 BY-SA版权

分类专栏：算法竞赛进阶指南 poj 高精度算法进位计数制文章标签：高精度进位计数制

本文链接：https://blog.youkuaiyun.com/qq_41958841/article/details/82461843

博客介绍了如何将数字从一种基于62个字符的进位计数制转换到另一种，包括从2到62的基数转换。通过样例输入和输出展示了转换过程，并分享了代码实现中遇到的错误和调试经验，特别是关于数值溢出的问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接

Description

Write a program to convert numbers in one base to numbers in a second base. There are 62 different digits:
{ 0-9,A-Z,a-z }
HINT: If you make a sequence of base conversions using the output of one conversion as the input to the next, when you get back to the original base, you should get the original number.

Input

The first line of input contains a single positive integer. This is the number of lines that follow. Each of the following lines will have a (decimal) input base followed by a (decimal) output base followed by a number expressed in the input base. Both the input base and the output base will be in the range from 2 to 62. That is (in decimal) A = 10, B = 11, …, Z = 35, a = 36, b = 37, …, z = 61 (0-9 have their usual meanings).