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
sughosh v kaushik:
2015-03-30 17:53:16
Should I use BigInteger for this problem or int is enough?Its giving me NZEC |
|
VigneshR:
2015-03-27 19:03:17
http://ideone.com/********
|
|
Ilya Tetin:
2015-03-26 23:45:06
Getting TLE in Java. :(
|
|
Ramesh:
2015-03-26 14:23:29
i'm using c#.code runs at Ideone.com, but when submit the solution, it gives runtime error.. Please provide the answer for it. I gave the input values in Ideone.com, when submit the solution there is no place to give the input values.. please give the reply for this. Last edit: 2015-03-26 14:24:05 |
|
Seven.Martinez:
2015-03-23 20:35:17
Got this using JAVA Last edit: 2015-03-23 22:46:06 |
|
copperfield:
2015-03-16 21:05:20
Great problem! |
|
RFarrell:
2015-03-16 16:03:32
Why aren't single digit numbers considered palindromes? They should be. Mine kept failing until I forced it to output 11 on any single digit.
|
|
minhthai:
2015-03-15 11:06:27
very good problem :) |
|
Manish Mishra:
2015-03-07 21:58:12
I wrote the program and it works fine and gives the results as expected. But still when I submit it here, it says wrong answer.
|
Added by: | adrian |
Date: | 2004-05-01 |
Time limit: | 2s-9s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: NODEJS PERL6 |