HDOJ(HDU) 2106 decimal system(进制相互转换问题)

简介: Problem Description As we know , we always use the decimal system in our common life, even using the computer.

Problem Description
As we know , we always use the decimal system in our common life, even using the computer. If we want to calculate the value that 3 plus 9, we just import 3 and 9.after calculation of computer, we will get the result of 12.
But after learning <>,we know that the computer will do the calculation as the following steps:
1 computer change the 3 into binary formality like 11;
2 computer change the 9 into binary formality like 1001;
3 computer plus the two number and get the result 1100;
4 computer change the result into decimal formality like 12;
5 computer export the result;

In the computer system there are other formalities to deal with the number such as hexadecimal. Now I will give several number with a kind of change method, for example, if I give you 1011(2), it means 1011 is a number in the binary system, and 123(10) means 123 if a number in the decimal system. Now I will give you some numbers with any kind of system, you guys should tell me the sum of the number in the decimal system.

Input
There will be several cases. The first line of each case contains one integers N, and N means there will be N numbers to import, then there will be N numbers at the next N lines, each line contains a number with such form : X1….Xn.(Y), and 0<=Xi

import java.util.Scanner;

public class Main{

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()){
            long sum=0;
            int n =sc.nextInt();
            String str = null;
            for(int i=0;i<n;i++){
                str =sc.next();
                String strs[] = str.split("\\(");
                int num = Integer.parseInt( strs[0]);

                String strHex = "";
                for(int j=0;j<strs[1].length();j++){
                    if(strs[1].charAt(j)!=')'){
                        strHex = strHex+strs[1].charAt(j);
                    }
                }

                int hex = Integer.parseInt(strHex);

                if(hex==10){
                    sum+=num;
                }else{
                    //hex为num这个数的进制基数。也就是说num为hex进制的数。
                    //返回的是一个十进制的数。。
                    num = Integer.parseInt(Integer.toString(num), hex);
                    sum+=num;
                }
            }

            System.out.println(sum);
        }
    }
}
目录
相关文章
base -2 Number——进制转换
题目描述 Given an integer N, find the base −2 representation of N. Here, S is the base −2 representation of N when the following are all satisfied: S is a string consisting of 0 and 1. Unless S= 0, the initial character of S is 1. Let S=SkSk−1…S0, then S0×(−2)0+S1×(−2)1+…+Sk×(−2)k=N.
86 0
HDOJ(HDU) 2106 decimal system(进制相互转换问题)
HDOJ(HDU) 2106 decimal system(进制相互转换问题)
69 0
HDOJ/HDU 2352 Verdis Quo(罗马数字与10进制数的转换)
HDOJ/HDU 2352 Verdis Quo(罗马数字与10进制数的转换)
151 0
HDOJ(HDU) 2113 Secret Number(遍历数字位数的每个数字)
HDOJ(HDU) 2113 Secret Number(遍历数字位数的每个数字)
91 0
|
Java
HDOJ 1018 Big Number(大数位数公式)
HDOJ 1018 Big Number(大数位数公式)
83 0
|
Java 测试技术
HDOJ(HDU) 1877 又一版 A+B(进制、、)
HDOJ(HDU) 1877 又一版 A+B(进制、、)
74 0
HDOJ(HDU) 1562 Guess the number(水题,枚举就行)
HDOJ(HDU) 1562 Guess the number(水题,枚举就行)
97 0