zoukankan      html  css  js  c++  java
  • specialized four-digit numbers C语言 ZOJ2405

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

    Input

    There is no input for this problem.

    <b< dd="">

    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.

    <b< dd="">

    Sample Input

    There is no input for this problem.

    Sample Output

    2992
    2993
    2994
    2995
    2996
    2997
    2998
    2999

    这道题不怎么难主要是进制转换

     1 //本代码在UVALive上需改动 
     2 #include <stdio.h>
     3 
     4 int jz(int a,int b){//求16进制4位数和 
     5     int sum=0;
     6     while(a){
     7         sum+=a%b;
     8         a=a/b;
     9     } 
    10     return sum;
    11 }
    12 
    13 int main(void){
    14     int i=2992;
    15     int a,b,c;
    16     for(;i<10000;i++){
    17         a=jz(i,16);
    18         b=jz(i,12);
    19         c=jz(i,10);
    20         if(a==b&&b==c){
    21              printf("%d
    ",i);
    22         }
    23     }
    24     return 0;
    25 }
    View Code
  • 相关阅读:
    线段树(updata+query)
    铁轨(栈)
    困难的串(搜索)
    素数环(简单搜索)
    编码
    opencv + numpy for python
    PIL参考手册
    八数码问题
    三维地图(BFS)
    梯田(dfs)
  • 原文地址:https://www.cnblogs.com/20174317zhuyuan/p/9388127.html
Copyright © 2011-2022 走看看