zoukankan      html  css  js  c++  java
  • 杭电1197 Specialized FourDigit 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
     
    View Code
     1 #include <stdio.h>
     2 #include <stdlib.h>
     3 
     4 int conversion(int n, int d)
     5 {
     6     int sum = 0;
     7     while( n )
     8     {
     9           sum += n % d;
    10           n = n / d;    
    11     }
    12     return sum;
    13 }
    14 
    15 int main(int argc, char *argv[])
    16 {
    17     int i, sum1, sum2, sum3;
    18     printf( "2992\n" );
    19     for( i = 2993; i < 10000; i++ )
    20     {
    21          sum1 = conversion(i,10);
    22          sum2 = conversion(i,16);
    23          sum3 = conversion(i,12);
    24          if( (sum1==sum2)&&(sum2==sum3) )
    25              printf( "%d\n", i );
    26     }
    27   
    28   //system("PAUSE");    
    29   return 0;
    30 }
  • 相关阅读:
    IntentService使用以及源码分析
    Android HandlerThread源码解析
    Android Handler消息机制源码解析
    Gradle技术之四
    Android EditText实现小数点后几位的终级方案
    Gradle系列之三 Gradle概述以及生命周期
    Gradle系列之二 Groovy对文件的操作
    Gradle系列之一 Groovy语法精讲
    Context源码分析
    用EXCLE群发outlook邮件
  • 原文地址:https://www.cnblogs.com/yizhanhaha/p/3017406.html
Copyright © 2011-2022 走看看