zoukankan      html  css  js  c++  java
  • ACM HDU 1197 Specialized FourDigit Numbers(简单进制转换)

    Specialized Four-Digit Numbers

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


    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
     

    Source
     

    Recommend
    Ignatius.L
     
    简单题:不解释:
    #include<stdio.h>
    #include
    <iostream>
    using namespace std;
    int ff(int n,int base)
    {
    int sum=0;
    while(n)
    {
    sum
    +=n%base;
    n
    /=base;
    }
    return sum;
    }
    int main()
    {
    int i;
    for(i=2992;i<=9999;i++)
    {
    int t=ff(i,10);
    if(t==ff(i,12)&&t==ff(i,16))
    printf(
    "%d\n",i);
    }
    //system("pause");
    return 0;
    }

  • 相关阅读:
    What's the most secure desktop operating system?
    合肥一中在校学生丁雯琪(中美班)被麻省理工学院(MIT)录取
    Classic Computer Science 1980s-1990s
    HOWTO do Linux kernel development
    选择器zuoye
    HTML+css 小组件
    弹性盒子
    CSS3 学习笔记(动画 多媒体查询)
    CSS3 学习笔记(边框 背景 字体 图片 旋转等)
    学习笔记css3
  • 原文地址:https://www.cnblogs.com/kuangbin/p/2124328.html
Copyright © 2011-2022 走看看