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
rushi2001:
2021-03-22 21:59:34
Started On 12 am
|
|
wowthecoder:
2021-03-20 08:39:44
AC with Java after 5-6 TLEs...
|
|
adrian_mole:
2021-02-22 01:56:55
The challenge clearly states: "Numbers are always displayed without leading zeros." So, how does 0003 give 0110 (one leading zero) not 4? And how does 0012100 give 0013100 (two leading zeroes) rather than 12121? |
|
makhan_28:
2021-02-20 10:26:58
Good Problem!!
|
|
rahultwr_ankur:
2021-02-19 14:47:33
After 2 hour struggling ..finally got AC..
|
|
wille_25:
2021-01-08 20:58:32
Finally AC --- (0.02s)
|
|
sher_007:
2021-01-07 11:27:04
I used string to take input as the input can be as large as 10^6 digits and then i stored it in an int array.
|
|
satyam552000:
2021-01-07 09:12:22
check for 9 and 99 and use strings it worked for me |
|
shreyasz_07:
2020-11-23 17:45:18
I'm getting tle Last edit: 2020-11-23 17:47:56 |
|
xander_70:
2020-11-16 09:57:10
How could I fix my TLE problem |
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 |