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
subham92:
20160427 14:06:43
time limit exceeded :( But it takes only 0.2 secs in ideone 

starun8795:
20160418 17:45:12
Hrithik, you can use a static array to handle big numbers in c/c++.


hrithik_sethia:
20160418 07:42:54
how can we make any code to work for large input numbers ?? in cpp 

q1_hoanglong:
20160416 11:53:27
have everyone tried test inp 999 out 1001 

manish3749:
20160412 16:39:02
i have taken more than 100 test cases ..all of them paased but here it is showing wronf answer 

ign_unnamed1:
20160406 12:50:57
what does this error code mean "runtime error (NZEC)" . My code is working on "ideone" but not here. i have written my code in c#.


last_mohican:
20160402 17:59:03
What happens if input integer is written with the beginning zero(s)? For example: 01010 

ghostcoder123:
20160402 14:30:19
please upgrade your fucking compilers in c atoi not working! 

nischaymalhan:
20160326 13:44:58
For those getting wrong answer it is probably because your code wont work for a large( e.g. : 100 )digit number


sonali9696:
20160323 22:19:20
check for the following:

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