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
Barun Parruck:
2015-05-28 11:06:34
What do we do if the given number is a palindrome? Last edit: 2015-05-28 11:07:05 |
|
Nitesh Tiwari:
2015-05-27 12:59:39
Hi, I'm getting RUNTIME ERROR SEGABRT.
|
|
SON_OF_SPARDA:
2015-05-25 19:43:24
problem took time but...
|
|
deep_07:
2015-05-22 14:49:42
All sorts of test cases checked but still getting a WA, can anybody pls check?
|
|
Ptotheextreme:
2015-05-22 12:53:23
i have fallen into the "i have every test correct but still WA" club... |
|
sohail01:
2015-05-19 11:25:17
How many test cases max? Is it mentioned anywhere? Last edit: 2015-05-19 11:46:04 |
|
munex:
2015-05-18 17:51:56
How can I "like" this problem ? |
|
Rakend Chauhan:
2015-05-17 15:26:22
finally got it right! |
|
shivam chandra:
2015-05-15 14:19:24
9 4 1 8 7 9 7 8 3 2 2------------>9 4 1 8 8 0 8 8 1 4 9
|
|
rahulsingh80:
2015-05-14 08:07:16
Finally! Got it right!! I feel like I should get a trophy for this. :)
|
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 |