The “reverse and add” method is simple: choose a number, reverse its digits and add it to the original. If the sum is not a palindrome (which means, it is not the same number from left to right and right to left), repeat this procedure. For example:
195 Initial number 591 —– 786 687 —– 1473 3741 —– 5214 4125 —– 9339 Resulting palindrome
In this particular case the palindrome ‘9339’ appeared after the 4th addition. This method leads to palindromes in a few step for almost all of the integers. But there are interesting exceptions. 196 is the first number for which no palindrome has been found. It is not proven though, that there is no such a palindrome. You must write a program that give the resulting palindrome and the number of iterations (additions) to compute the palindrome.
You might assume that all tests data on this problem:
The first line will have a number N (0 < N <= 100) with the number of test cases, the next N lines will have a number P to compute its palindrome.
For each of the N tests you will have to write a line with the following data: minimumNumberOfIterationsToGetToThePalindrome and TheResultingPalindromeItself separated by one space.
3 195 265 750
4 9339 5 45254 3 6666
This challenge is provided by the ACM International Collegiate Programming Contest.
Please log in to submit your solution.
|Average test runtime||0.25|
|Points (changes over time)||10|
|Tried by||21 users|
|Solved by||20 users|
|19||Eren B. Yilmaz||0.39||6|