进制转换
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
样例
C++暑期测试(袁 0710午)
- Status
- Done
- Rule
- IOI
- Problem
- 5
- Start at
- 2026-7-10 13:30
- End at
- 2026-7-10 15:00
- Duration
- 1.5 hour(s)
- Host
- Partic.
- 7