sicily可供练习题-1014. Specialized Four-Dig

sicily可供练习题-1014. Specialized Four-Dig

标签（空格分隔）： sicily

---

题目挺简单的，但是却十分注重学生对记数系统基础知识的掌握，先来看下题目：
限制条件
时间限制: 1 秒, 内存限制: 32 兆
题目描述

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

输入格式
There is no input for this problem
输出格式
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.
样例输入
There is no input for this problem
样例输出
2992
2993
2994
2995
2996
2997
2998
2999

题目解释：就是给你一个十进制的四位数，将它转化为十二进制和十六进制，然后分别求三种进制下各个数位之和，然后对比三种情况下的数位和是否相等，如果相等就输出。

下面是我的代码：

#include <iostream>

using namespace std;

int Dec(int num) {  //  十进制 
    int sum = 0;
    int numm = num;
    while (numm) {
        sum += numm%10;
        numm /= 10;
    }
    return sum;
}

int Duo(int num) {  //  十二进制 
    int sum = 0;
    int numm = num;
    while (numm) {
        sum += numm%12;
        numm /= 12;
    }
    return sum;
}

int Hex(int num) {  //  十六进制 
    int sum = 0;
    int numm = num;
    while (numm) {
        sum += numm%16;
        numm /= 16;
    } 
    return sum;
} 

bool IsOk(int num) {
    int decimal = Dec(num);
    int duodecimal = Duo(num);
    int hexadecimal = Hex(num);
    if (decimal == duodecimal && decimal == hexadecimal) return true;  //  比较三种情况的数位和是否相等 
    return false;
}

int main() {
    for (int i = 2992; i <= 9999; i++)
    if (IsOk(i)) cout << i << endl;
    return 0;   
}

当然可以用C++的template写一个模板，参数分别是数字和相应的进制，模板会更加简化代码。代码如下:

#include <iostream>

using namespace std;

template <class T>  //  通用模板 
int Sum(T num, T jinzhi) {
    int sum = 0;
    int numm = num;
    while (numm) {
        sum += numm%jinzhi;
        numm /= jinzhi;
    }
    return sum;
} 

bool IsOk(int num) {
    int decimal = Sum(num, 10);
    int duodecimal = Sum(num, 12);
    int hexadecimal = Sum(num, 16);
    if (decimal == duodecimal && decimal == hexadecimal) return true;  //  比较三种情况的数位和是否相等 
    return false;
}

int main() {
    for (int i = 2992; i <= 9999; i++)
    if (IsOk(i)) cout << i << endl;
    return 0;   
}