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
xinnix:
2016-05-21 14:47:44
Wth! Working everytime in my compiler but says wrong output here.... What's going on?
|
|
avisheksanvas:
2016-05-18 08:51:54
Be careful while comparing.
|
|
Gaurav Kumar:
2016-05-12 14:37:59
hey , Is 1000 a palindrome ?
|
|
earlgreyhot:
2016-05-11 22:25:19
If you use recursion you will get NZEC (in python at least) |
|
boney_412:
2016-05-10 20:22:01
Can anyone tell me how to rectify NZEC runtime
|
|
palash_123:
2016-05-09 14:00:37
I'm unable to get the output to thi question.
|
|
roisym:
2016-05-04 14:40:58
This is a great problem! I'm a beginner (this is my 10th day learning programing from nothing). It took me many tries but finally got accepted(c#). Tips for beginners like myself (POSSIBLE SPOILER ALERT):
|
|
subham92:
2016-04-27 14:06:43
time limit exceeded :( But it takes only 0.2 secs in ideone |
|
starun8795:
2016-04-18 17:45:12
Hrithik, you can use a static array to handle big numbers in c/c++.
|
|
hrithik_sethia:
2016-04-18 07:42:54
how can we make any code to work for large input numbers ?? in cpp |
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 |