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
Yogesh Jindal:
2014-12-25 09:52:32
Last edit: 2014-12-25 09:57:09 |
|
Dan Pallas:
2014-12-18 02:39:53
One thing that isn't really part of the problem that caused me some issues. The last (at least I assume it was the last) input doesn't have a newline character in it. Don't assume that all inputs do. |
|
LabdaABeta:
2014-12-15 19:58:49
@naman gupta (and others)
|
|
Manglesh Sharma:
2014-12-09 19:12:15
what is expected in case where the integer has more than 1000000 digits
|
|
numerix:
2014-12-09 18:07:54
@Kushagra Bhatnagar: Why do you post your comment here, though it was a problem with your submissions for FIBOSUM?
|
|
Kushagra Bhatnagar:
2014-12-09 15:11:40
My Code Is running Fine In Python
|
|
naman gupta:
2014-12-08 15:16:38
<snip>
|
|
Dawid:
2014-12-06 23:58:21
Hi guys, why does it say "compilation problem" while ideone runs it smooth? (C++). |
|
asitm9:
2014-12-04 04:03:34
@Jasdeep: check for 10. It should be 11. Last edit: 2014-12-04 04:04:15 |
|
gamer496:
2014-12-03 22:59:22
@admin could you check my solution i'm
|
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 |