HODJ1197 Specialized Four-Digit Numbers

Specialized Four-Digit Numbers

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7715    Accepted Submission(s): 5673

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
  
  

  题意：

假设a=N的十进制的每一位的和

假设b=N的十二进制的每一位的和

假设c=N的十六进制的每一位的和

如果a==b==c，那么就输出N

可以先将进制转换一下，然后求和，判断...

public class Main {
	public static void main(String[] args) {
		for (int i = 2992; i <= 9999; i++) {
			if(judge(i)){
				System.out.println(i);
			}
		}
	}
	public static boolean judge(int n){
		int sum10 = sum(n,10);
		int sum12 = sum(n,12);
		int sum16 = sum(n,16);
//		System.out.println(sum10+" "+sum12+" "+sum16);
		if(sum10==sum12&&sum10==sum16&&sum12==sum16){
			return true;
		}
		return false;
	}
	public static int sum(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 = n / m;
		}
		if (n > 0) {// 如果还有余数
			string = ch[n] + string;
		}
		//然后求和
		int sum = 0;
		for (int i = 0; i < string.length(); i++) {
			for (int j = 0; j < ch.length; j++) {
				if(ch[j]==string.charAt(i)){
					sum+=j;
					break;
				}
			}
		}
		return sum;
	}
}