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
|
azazello_:
2017-06-20 10:07:14
@balaram_tupili
|
|
balaram_tupili:
2017-06-17 14:35:31
pls help TLE ...
|
|
unityofdis:
2017-06-11 02:52:05
I don't know what's wrong with my solution, as one of the comments I executed in ideone and have no problem :( |
|
kartiks22:
2017-06-10 10:36:34
Someone Pls tell me some efficient way to take input directly into vector (c++)....got AC but not satisfied with time and memory. |
|
hddw3:
2017-06-06 20:51:36
Shouldnt the anserw for 2133 be 2145? According to windows calculator:
|
|
monster_666:
2017-06-05 13:54:52
what should be the ans of
|
|
hr_hr_mahadev:
2017-06-03 04:12:28
Guys my code is running everywhere except spoj......please help.... : \
|
|
nitish676:
2017-06-01 09:27:57
i'm using c++ and took my variable as int my program passes all the test cases but still it says wrong answer.
|
|
leafbebop:
2017-05-31 18:07:00
Note for golang: This will cause bufio.Scanner crash with "buffer too long". |
|
lbangur:
2017-05-30 09:03:37
My code is running perfect in codeBlocks and on codeChef compiler but spoj compiler is giving me "runtime error (SIGSEGV)" error.
|
| 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