zoukankan      html  css  js  c++  java
  • Hdu 1197 Specialized Four-Digit Numbers

    Specialized Four-Digit Numbers

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 7038    Accepted Submission(s): 5148

    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

    #include <stdio.h> 
    int main()  
        {  
            int i,sum1,sum2,sum3,n,r;  
       for(i = 1000; i<9999; i++)  
            {  
                n = i;  
                sum1 = sum2 = sum3 = 0;  
                while(n)  
                {  
                    r=n%10;  
                    sum1+=r;  
                    n/=10;  
                }  
                n = i;  
                while(n)  
                {  
                    r=n%12;  
                    sum2+=r;  
                    n/=12;  
                }  
                if(sum1 == sum2)  
                {  
                    n = i;  
                    while(n)  
                    {  
                        r=n%16;  
                        sum3+=r;  
                        n/=16;  
                    }  
                    if(sum3 == sum1)  
                      printf("%d
    ",i);
                }  
            }  
          
          
            return 0;  
        } 
    

      

  • 相关阅读:
    helix matrix 螺旋矩阵
    利用基数排序生成100个1000以内顺序排列的随机数
    第三次随笔
    gSoap: How to add info to SOAP Header using gSOAP(转)
    sizeof empty class object
    C++基础回顾字符串地址比较
    (转)RVA相对虚拟地址解释
    团队建设历史经验回顾
    C++全局变量的生老病死
    C++基础回顾强制类型转换
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7057928.html
Copyright © 2011-2022 走看看