HDOJ1335 Basically Speaking(进制转换)
来源:互联网 发布:fastdfs nginx 缩略图 编辑:程序博客网 时间:2024/06/05 14:59
Basically Speaking
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3642 Accepted Submission(s): 1487
Problem Description
The Really Neato Calculator Company, Inc. has recently hired your team to help design their Super Neato Model I calculator. As a computer scientist you suggested to the company that it would be neato if this new calculator could convert among number bases. The company thought this was a stupendous idea and has asked your team to come up with the prototype program for doing base conversion. The project manager of the Super Neato Model I calculator has informed you that the calculator will have the following neato features:
It will have a 7-digit display.
Its buttons will include the capital letters A through F in addition to the digits 0 through 9.
It will support bases 2 through 16.
It will have a 7-digit display.
Its buttons will include the capital letters A through F in addition to the digits 0 through 9.
It will support bases 2 through 16.
Input
The input for your prototype program will consist of one base conversion per line. There will be three numbers per line. The first number will be the number in the base you are converting from. The second number is the base you are converting from. The third number is the base you are converting to. There will be one or more blanks surrounding (on either side of) the numbers. There are several lines of input and your program should continue to read until the end of file is reached.
Output
The output will only be the converted number as it would appear on the display of the calculator. The number should be right justified in the 7-digit display. If the number is to large to appear on the display, then print "ERROR'' (without the quotes) right justified in the display.
Sample Input
1111000 2 101111000 2 162102101 3 102102101 3 15 12312 4 2 1A 15 21234567 10 16 ABCD 16 15
Sample Output
120 78 1765 7CA ERROR 11001 12D687 D071
题意:将将n进制的num 转换为 m进制。
要是转换时候大于七位数,输出 ERROR。否则按题目要求的格式输出。
import java.util.Scanner;public class Main{private static Scanner scanner;public static void main(String[] args) {scanner = new Scanner(System.in);while(scanner.hasNext()){//将n进制的num 转换为 m进制String num = scanner.next();int n = scanner.nextInt();int m = scanner.nextInt();//if(num.equals("0")){//不需要//System.out.printf("%7d",0);//System.out.println();//}//先转换为十进制int res = Integer.parseInt(num, n);//System.out.println(res);//再转换为m进制String string = change(res, m);//输出if(string.length()>7){System.out.println(" ERROR");}else {System.out.printf("%7s",string);System.out.println();}}}public static String change(int n,int m){//十进制n的m进制char ch[] = {'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};String string = "";while(n/m>0){string = ch[n%m]+string;n/=m;}if(n>0){//如果还有余数string = ch[n]+string;}return string;}}
阅读全文
0 0
- HDOJ1335 Basically Speaking(进制转换)
- 【水题】hdoj1335 Basically Speaking
- HDU 1335 Basically Speaking (模拟进制转换)
- zoj 1334 Basically Speaking(进制转换)
- HDOJ 1335 Basically Speaking(进制转换)
- HDU 1335 Basically Speaking(进制转换问题)
- hdu2031 进制转换 && hdu2097 Sky数 && hdu1335 Basically Speaking(进制转换)
- POJ1546 & HDU 1335 & ZOJ 1334 Basically Speaking(进制转换)
- HDU 1335 Basically Speaking(进制转化)
- poj 1546 Basically Speaking 进制转化
- Basically Speaking
- Basically Speaking
- POJ 1546 Basically Speaking
- UVa389 - Basically Speaking
- zoj 1334 Basically Speaking
- zoj 1334 Basically Speaking
- ZOJ 1334 Basically Speaking
- ZOJ 1334 Basically Speaking
- leetcode 712 Minimum ASCII Delete Sum for Two Strings
- 2017-12-7 训练营第二天
- 精益思想第六原则:从生产力到生产关系
- VMware Tools安装教程
- VS2013常用快捷键
- HDOJ1335 Basically Speaking(进制转换)
- 【学习路线图】涵盖主要算法
- Oracle数据库优化(重点)
- 数据结构实验之图论六:村村通公路
- android百度地图开发V4.5最新版(3)---计算地图上俩点之间的距离
- 服务器性能监控软件的选择
- Leetcode 416 Partition Equal Subset Sum (算法分析week14)
- 上层APP调用底层硬件驱动过程解析
- 布局问题