Sphere Online Judge

SPOJ Problem Set (classical)

5. The Next Palindrome

Problem code: PALIN

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.


The first line contains integer t, the number of test cases. Integers K are given in the next t lines.


For each K, output the smallest palindrome larger than K.




Warning: large Input/Output data, be careful with certain languages

Added by:Adrian Kosowski
Time limit:2s-9s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All except: NODEJS PERL 6

hide comments
2014-10-26 10:01:04 Sergey Skupoy
NZEC in Haskell. Something is wrong with EOL.

Last edit: 2014-10-31 23:19:29
2014-10-25 10:54:26 karan
finally :') :') this gave a strong feel :D :')
2014-10-23 06:55:11 huangqi-hy
2 is one digit and 20 is two and 1,000 is four,so 1000000 digits means the number has 1000000 number in it
2014-10-22 21:01:11 Thiefds
What means "For a given positive integer K of not more than 1000000 digits"?
2014-10-10 10:25:14 Vamsi Krishna Avula

Last edit: 2014-10-28 05:52:32
2014-10-10 09:40:53 legend80s
my code (in c++) runs fine in my computer, but got a Wrong Answer after my submission, can someone give me some test cases, or just give me some hint about how to test it.
2014-10-10 07:51:43 Suryakalyan Rani
Completely missed the part "K of not more than 1000000 digits"
2014-10-08 08:50:12 Govinda
in java StringBuffer has reverse() ,so reverse and compare them

Last edit: 2014-10-08 08:50:30
2014-10-06 00:48:18 Ramon
I need some help, please. My code runs fine in my machine but gets a WA. Can someone post a good set of test cases, please?
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.