HDU1197 Specialized Four-Digit 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

Source
Pacific Northwest 2004

Recommend
Ignatius.L | We have carefully selected several similar problems for you: 1205 1201 1157 1234 1194
题意：输出所有 十进制位数相加和十二进制位数相加和十六进制位数相加都相等的四位数

思路：题意一开始看上去很可怕，其实直接用辗转相除就好了

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
int zhengling(int i,int n)
{
    int sum = 0;
    while(i)
    {
          sum = sum+i%n;
          i = i/n;  
            }
    return sum;
}
int main()
{

    for(int i = 1000;i<=9999;i++)
    {
            int sum1 = zhengling(i,10);
            int sum2 = zhengling(i,12);
            int sum3 = zhengling(i,16);

            if(sum1 == sum2 && sum1 == sum3)
            {
                    cout<<i<<endl;
                    }
            }
    return 0;
}