Specialized Four-Digit Numbers

Specialized Four-Digit Numbers

题目描述

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 = 11728 + 8144 + 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.)
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

题目理解

本题就是计算所以4位十进制数,判断该数各位数字之和是否与其对应的十二进制各位之和及十六进制各位之和相等。想要解决该问题,我们首先就要解决如何找到对应的十二进制数与十六进制数。根据十进制与其他进制的交换规则,我们可以知道,十进制数就等于其他进制数各个位数乘进制数的n次方的和。例如十六进制如下:

十进制十六进制转化
257101257=1*162+0*161+1*160

所以我们可以通过两者之间的关系,将十进制数转化为十六进制和十二进制数。具体方法见代码。

代码展示

#include <stdio.h>
#include <stdlib.h>
int A(int n,int base)
{
    int sum=0;
    while(n!=0)
    {
        sum+=n%base;
        n/=base;
    }
    return sum;
}
int main()
{
    int num=1000;
    int sum;
    for(;num<10000;num++)
    {
        sum=num/1000+num/100%10+num/10%10+num%10;
        if(sum==A(num,16)&&sum==A(num,12))
            printf("%d\n",num);
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值