• Specialized Four-Digit Numbers


    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
     
     1 #include <stdio.h>
     2 
     3 int sum(int number,int p);
     4 
     5 int main(){
     6     int a;
     7     int b;
     8     int c;
     9     int i;
    10     
    11     for(i=1000;i<=9999;i++){
    12         a=sum(i,10);
    13         b=sum(i,12);
    14         c=sum(i,16);
    15         
    16         if(a==b && b==c)
    17             printf("%d
    ",i);
    18     }
    19     
    20     
    21     
    22     return 0;
    23 } 
    24 
    25 int sum(int number,int p){
    26     int result;
    27     
    28     result=0;
    29     while(number){
    30         result+=number%p;
    31         number/=p;
    32     }
    33     
    34     return result;
    35 }
  • 相关阅读:
    HDU1312 ZOJ2165 Red and Black
    HDU1312 ZOJ2165 Red and Black
    HDU1181 变形课【DFS】
    codevs1017 乘积最大
    codevs1220 数字三角形
    codevs1169 传纸条
    codevs1219 骑士游历
    codevs1010 过河卒
    codevs1166 矩阵取数游戏
    codevs1154 能量项链
  • 原文地址:https://www.cnblogs.com/zqxLonely/p/4090307.html
Copyright © 2020-2023  润新知