PALIN - The Next Palindrome
A positive integer is called a palindrome if its representation in the decimal system is the same when read from left to right and from right to left. For a given positive integer K of not more than 1000000 digits, write the value of the smallest palindrome larger than K to output. Numbers are always displayed without leading zeros.
The first line contains integer t, the number of test cases. Integers K are given in the next t lines.
For each K, output the smallest palindrome larger than K.
Warning: large Input/Output data, be careful with certain languages
why "time limit exceeded"? my code works perfectly on my computer and in Ideone.com
For those who are getting WA even after confirming all test cases use cin instead of fflush and scanf. I just changed that in my code even without looking at it(which was months old) and got AC. scanf is a mess for strings and char arrays.Last edit: 2015-11-15 17:29:57
Confirmed that there are nothing wrong with the test cases. If u get a WA then there's some problem with ur code. I literally used an hour to debug just to reach an Accepted. Try 999, 8997, 3, 9, 100, 1000, 9999 beforehand.
First make a simple ago. (just for handling int) then make it more sophisticated for handling large numbers.Last edit: 2015-11-12 11:59:10
@abhi_269, go try "999999999999".
FYI: Almost everyone that posts on the forum for this problem skips exactly one word in this problem statement.Last edit: 2015-11-03 15:15:31
Very nice adhoc problem :) Got AC in first submission here but after many debugging. Had to generate a bruteforce solution of 1 to 10000 numbers and then match with my approach to find corner cases.
Hahaha, accepted on the first go!! Love the problem!
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Languages:||All except: NODEJS PERL 6|