Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1431 Accepted Submission(s): 1017
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.)
#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;
}