您的位置:首页 > 其它

HDOJ 1197 Specialized Four-Digit Numbers

2015-08-07 00:43 309 查看

Specialized Four-Digit Numbers

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2260 Accepted Submission(s): 1493
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




继续ACM Steps。
题目意思是:判断一个大于等于2992的数的十进制各位数相加之和与它的十二进制,十六进制数各位数相加之和是否相等。 相等就输出这个数。

题目没有输入,直接输出。代码如下:

#include<cstdio>
int main()
{
	int i,a,b,c,n;
	for(i=2992;i<10000;i++)
	{
		a=b=c=0;
		n=i;
		while(n)
		{
			a+=n%10;
			n/=10;
		}
		n=i;
		while(n)
		{
			b+=n%12;
			n/=12;
		}
		n=i;
		while(n)
		{
			c+=n%16;
			n/=16;
		}
		if(a==b&&b==c)
		   printf("%d\n",i);
	}
	return 0;
}


内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: