Type: Default 1000ms 256MiB

转进制

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

用递归算法将一个十进制数X转换成任意进制数M(M≤16)。

Input Format

一行两个数,第一个十进制数X,第二个为进制M。

Output Format

输出结果。

31 16 {将十进制31转化为十六进制数}

1F

递归和深度优先搜索(dfs)

Not Claimed
Status
Done
Problem
9
Open Since
2026-5-16 0:00
Deadline
2026-5-24 23:59
Extension
24 hour(s)