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
hkuadithya:
2017-05-02 06:46:16
Easy problem. A few tips for folks who are stuck.
|
|
lpbove:
2017-05-02 02:51:20
I've been looking through the comments and I've yet to find a case in which my program fails.
|
|
boyue:
2017-04-23 12:26:12
wrong answer too, even passed every test case...
|
|
Neeraj Jain:
2017-04-22 19:14:52
Getting `runtime error (NZEC)`, All Test Cases working fine , even which @piyush1339 mentioned, if anyone can help.
|
|
rubel_cs:
2017-04-17 11:42:39
Though my code passed every test cases in comment section still getting wrong answer :( |
|
alim97:
2017-04-07 15:16:16
It's funny. I submitted my own code that was accepted last time. And now it gives Wrong answer :D |
|
masterbios:
2017-04-02 22:59:12
if you got NZEC in java simply use
|
|
rachit690:
2017-04-01 16:09:40
Pls check my code, its giving write answer for all test cases i run, still i get WA |
|
shubha_096:
2017-03-31 06:40:31
where my code lacks?
|
|
Juan:
2017-03-26 03:40:18
@satyamr1 I'm trying to solve it keeping the string representation of the number and building the next palindrome by string manipulation. I won't give more details, because it would simply give too much information |
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 |