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
amrkk:
2017-03-25 21:13:44
I am getting run time error but don't understand why, can anyone help?? |
|
piyush1399:
2017-03-25 19:46:27
Finally after three month I got AC. And all the credit goes to Poojan Patel(@poojan124) because her test case help me a lot.
|
|
nachi_w:
2017-03-23 05:59:58
Guys where can i find the test cases??
|
|
akibk001:
2017-03-21 21:58:49
thanks dimz01 for the test case 9
|
|
sandy1410:
2017-03-21 16:27:13
nice question |
|
nkumar_1896:
2017-03-19 20:04:20
lovely que. |
|
arthur1991:
2017-03-19 09:40:56
i love qianqian |
|
amarjeet_123:
2017-03-14 21:31:13
how can i reduce my runtime |
|
alexakel:
2017-03-06 10:07:56
Is there effective test cases? How can I check, whether my program works well on this site? It is awful service. CodingGame in such way is more better |
|
satyamr1:
2017-02-23 14:02:07
How to store such a large number with 1000000 digits? |
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 |