1014[Specialized Four-Dig]

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 189312, 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.)

*************************************************************************************************************

意思是从2992这个四位数开始,找到一种特殊的四位数,它的十进制形式的每一位相加等于它的十二进制形式的每一位相加等于它的十六进制形式的每一位相加。找到并输出这样的四位数。

还好,比较简单- -

#include<iostream>

using namespace std;

int main()
{
	int i;
	for( i = 2992; i <10000; i++ ){
		int sumD, sumDD, sumH;	//sumDecimal sumDuodecimal sumHexadecimal
		sumD = i/1000 + i/100%10 + i/10%100%10 + i%1000%100%10;
		sumDD = i/1728 + i/144%12 + i /12%144%12 + i%1728%144%12;
		sumH = i/4096 + i/256%16 + i/16%256%16 + i%4096%256%16;
		if( sumD == sumDD && sumD == sumH && sumDD == sumH )
			cout << i << endl;
	}

	return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值