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
asitm9:
20141204 04:03:34
@Jasdeep: check for 10. It should be 11. Last edit: 20141204 04:04:15 

gamer496:
20141203 22:59:22
@admin could you check my solution i'm


asitm9:
20141203 09:55:22
AC in 3rd GO... :) Last edit: 20141204 03:53:09 

Mayank Ladia:
20141203 09:38:20
Finally.. :') just coz of array size cost me 3 .. 

Minsuk Kim:
20141127 09:28:45
Nice problem  a hint is to think about the cases for the odd number of digits and even number of digits separately 

Rafael Cunha de Almeida:
20141119 04:10:12
I can't figure out which number is breaking my code :( I've made a test case of thousands of random numbers and they all passed. I'm out of ideas :( 

NPR:
20141118 12:23:02
Hi! I want to know if anybody can send to me a list with all cases of input ? My problem is that I'm not sure if input can be for example: 005 and if it can, which is the next palindrome ? 6 or 101 ? Thank you 

HARSH MADHOGARIA:
20141110 21:44:08
http://ideone.com/cOQfuo


kp:
20141107 10:03:50
Ans for 000000 should have been 1 or 11 but its different..showing with toolkit!! anybody to explain?? 

Manraj Singh:
20141106 09:36:22
This is one question that teaches you case handling.

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