HDOJ 1197 Specialized Four-Digit Numbers

简介: HDOJ 1197 Specialized Four-Digit Numbers

Problem Description

Find and list all four-digit numbers in decimal notation that have the property that the sum of its four digits equals the sum of its digits when represented in hexadecimal (base 16) notation and also equals the sum of its digits when represented in duodecimal (base 12) notation.


For example, the number 2991 has the sum of (decimal) digits 2+9+9+1 = 21. Since 2991 = 1*1728 + 8*144 + 9*12 + 3, its duodecimal representation is 1893(12), and these digits also sum up to 21. But in hexadecimal 2991 is BAF16, and 11+10+15 = 36, so 2991 should be rejected by your program.


The next number (2992), however, has digits that sum to 22 in all three representations (including BB016), so 2992 should be on the listed output. (We don’t want decimal numbers with fewer than four digits - excluding leading zeroes - so that 2992 is the first correct answer.)


Input

There is no input for this problem.


Output

Your output is to be 2992 and all larger four-digit numbers that satisfy the requirements (in strictly increasing order), each on a separate line with no leading or trailing blanks, ending with a new-line character. There are to be no blank lines in the output. The first few lines of the output are shown below.


Sample Input

There is no input for this problem.


Sample Output

2992

2993

2994

2995

2996

2997

2998

2999


题意:输入一个十进制数,看这个十进制的数的各个位数上的和,和它的12进制和16进制上的各个位数上的和是不是相等,相等就输出。

(十进制的数范围[2992-9999])

public class Main{
    public static void main(String[] args) {
        for(int i=2992;i<=9999;i++){
            int a = i/1000+(i/100)%10+(i/10)%10+i%10;
            String str = Integer.toString(i, 12);
            //System.out.println(str);
            int b = 0;
            for(int j=0;j<str.length();j++){
                switch(str.charAt(j)){
                case 'a':b=b+10;break;
                case 'b':b=b+11;break;
                default:b=b+(new Integer(str.charAt(j)+""));
                }
            }
            if(a!=b){
                continue;
            }
            int c=0;
            str = Integer.toString(i, 16);
            //System.out.println(str);
            for(int j=0;j<str.length();j++){
                switch(str.charAt(j)){
                case 'a':c=c+10;break;
                case 'b':c=c+11;break;
                case 'c':c=c+12;break;
                case 'd':c=c+13;break;
                case 'e':c=c+14;break;
                case 'f':c=c+15;break;
                default:c=c+(new Integer(str.charAt(j)+""));
                }
            }
            if(a!=c){
                continue;
            }
            System.out.println(i);
        }
    }
}
目录
相关文章
hdoj 1907
这是一道博弈的题,准确说是尼姆博弈,只要判断各项的异或值即可。
39 0
HDOJ 2050 折线分割平面
HDOJ 2050 折线分割平面
138 0
HDOJ 2050 折线分割平面
HDOJ 2075 A|B?
HDOJ 2075 A|B?
82 0
|
机器学习/深度学习 网络协议 缓存
HDOJ 1303 Doubles(简单题)
Problem Description As part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 uniq...
989 0
HDOJ 2802 F(N)
Problem Description Giving the N, can you tell me the answer of F(N)? Input Each test case contains a single integer N(1
720 0
HDOJ 2056 Rectangles
Problem Description Given two rectangles and the coordinates of two points on the diagonals of each rectangle,you have to calculate the area of the intersected part of two rectangles.
1013 0
|
人工智能 BI
HDOJ 2040 亲和数
Problem Description 古希腊数学家毕达哥拉斯在自然数研究中发现,220的所有真约数(即不是自身的约数)之和为: 1+2+4+5+10+11+20+22+44+55+110=284。
870 0