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.
Input
The first line contains integer t, the number of test cases. Integers K are given in the next t lines.
Output
For each K, output the smallest palindrome larger than K.
Example
Input: 2 808 2133 Output: 818 2222
Warning: large Input/Output data, be careful with certain languages
hide comments
ashisha690:
20180522 09:40:03
@ayushtopper string


ayushtopper:
20180521 09:52:35
Since input can be very very large like 13413515134000000000000000013488097081324


cabbie:
20180518 02:06:13
Spent so much time on this. But finally got it :) 

adityamudgil:
20180510 19:22:27
it takes 0.03 sec Last edit: 20180510 19:23:14 

linearspam:
20180506 22:54:09
difficult life lesson: remove printf debugging before submitting... 

chibaku_tensei:
20180421 16:31:52
Why is the Integer 2 not also an Palindrome ? 

David Winiecki:
20180409 08:10:24
Don't assume every line ends in a newline. I had to add logic like "if last character of input read from this line is not a number, then remove it (decrement length), else do nothing (don't decrement length)". Took me a very long time to figure that out. Extremely frustrating. :/ 

ashutoshiiita:
20180330 18:04:55
TLE on using boost library of C++ why?? 

prabhakar2050:
20180327 13:32:57
@Piotrek Nicowski Thanks :D 

Piotrek Nicowski:
20180323 20:39:46
@prabhakar2050  For each K, output the smallest palindrome *** LARGER THAN *** K.

Added by:  adrian 
Date:  20040501 
Time limit:  2s9s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 