进制转换
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.
说明
读入一个正整数n，（0<n<maxint）,将它转换为二进制，八进制，十六进制。
【输入样例】
456
【输出样例】
111001000
710
1C8
样例
2026暑假C++训练（袁）
- Status
- Done
- Problem
- 32
- Open Since
- 2026-7-14 0:00
- Deadline
- 2026-8-31 23:59
- Extension
- 24 hour(s)