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
|
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
|
|
|
asitm9:
2014-12-03 09:55:22
AC in 3rd GO... :) Last edit: 2014-12-04 03:53:09 |
|
Mayank Ladia:
2014-12-03 09:38:20
Finally.. :') just coz of array size cost me 3 .. |
|
Minsuk Kim:
2014-11-27 09:28:45
Nice problem - a hint is to think about the cases for the odd number of digits and even number of digits separately |
|
Rafael Cunha de Almeida:
2014-11-19 04:10:12
I can't figure out which number is breaking my code :( I've made a test case of thousands of random numbers and they all passed. I'm out of ideas :( |
| 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 |
RSS