#266. 进制转换
进制转换
No submission language available for this problem.
说明
读入一个正整数n,(0<n<maxint),将它转换为二进制,八进制,十六进制。
【输入样例】
456
【输出样例】
111001000
710
1C8
样例
No submission language available for this problem.
读入一个正整数n,(0<n<maxint),将它转换为二进制,八进制,十六进制。
【输入样例】
456
【输出样例】
111001000
710
1C8
By signing up a Hydro universal account, you can submit code and join discussions in all online judging services provided by us.