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 BAF 16, 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 16), 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.)
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 BAF 16, 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 16), 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 ...
题意:寻找一个四位数:十进制各个位加起来,12进制各个位加起,16进制各个位加起来三者相等,例子给出了第一个,一开始想到的只算12和16进制各位想加,十进制只需每次加一,我脑子抽了。,,一定要都加一起对比,,,
#include<iostream> using namespace std; int main() { int i,j,k,temp,sum1,sum2,m; int n=2991; while(n<=9999) { n+=1; sum1=0,sum2=0,m=0; temp=n; while(temp>0)//十进制各位总和 { m+=temp%10; temp/=10; } temp=n; while(temp>0)//12进制 { sum1+=temp%12; temp/=12; } temp=n; while(temp>0)//16进制 { sum2+=temp%16; temp/=16; } if(m==sum1&&m==sum2) { cout<<n<<endl; } } return 0; }