hdu acm 1.2.8 Specialized Four-Digit Numbers (进制转换)

最新推荐文章于 2019-12-18 21:24:52 发布

不懂就点击右键

最新推荐文章于 2019-12-18 21:24:52 发布

阅读量546

点赞数

分类专栏： hdu ACM 解题报告

本文链接：https://blog.csdn.net/zqs305082800/article/details/8846449

版权

hdu ACM 解题报告专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Specialized Four-Digit Numbers

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 1382 Accepted Submission(s): 925

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

Source

Pacific Northwest 2004

Recommend

Ignatius.L

#include <stdio.h>
#include <iostream>
using namespace std;

int change(int a,int dec);

int main()
{
	for(int i = 1000; i < 10000; i++)
	{
		int aa = change(i,10);
		int bb = change(i,12);
		int cc = change(i,16);
		if(aa == bb && bb == cc)
		{
			printf("%d\n",i);
		}
	}
	return 0;
}



int change(int a,int dec)
{
	int sum = 0;
	for(int i = 0; i < 4; i++)
	{
		sum += a%dec;
		a /= dec;
	}
	return sum;
}