SOJ 1014

1014. Specialized Four-Dig

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

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) notationand 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₁₂, and these digits also sum up to 21.  But in hexadecimal 2991 is BAF₁₆, 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 BB0₁₆), 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

  这题实在是很简单，看懂题目就行，直接贴代码就不写注释了。
// Problem#: 1014
// Submission#: 4933222
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include<iostream>
#include<cmath>
using namespace std;

int Toduo(int n)
{
    int result=0;
    while(n!=0)
    {
        result+=n%12;
        n/=12;
    }
    
    return result;
    
}

int Tohex(int n)
{
    int result=0;
    while(n!=0)
    {
        result+=n%16;
        n/=16;
    }
    
    return result;
}

int Tode(int n)
{
    int result=0;
    while(n!=0)
    {
        result+=n%10;
        n/=10;
    }
    
    return result;
}

int main()
{
    for(int i=2992;i<10000;++i)
    {
        if(Tode(i)==Tohex(i)&&Tode(i)==Toduo(i))
        cout<<i<<endl;
    }
    return 0;
}