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:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All except: NODEJS PERL 6

hide comments
2014-08-01 06:30:15 marcuuus
Damn input! I strungled a lot against that!
2014-07-31 23:04:17 eti goel
can number be 00000000
2014-07-30 00:50:18 Hidenori
It's very easy to write bruteforce solution, so it was really easy to test!
2014-07-27 17:31:11 LeppyR64
Read the problem statement carefully there have been many posts on the forum with people missing the same detail:
"For a given positive integer K of not more than 1000000 digits"
2014-07-26 20:52:06 Nakul Mohan
nice problem...AC finally :)
2014-07-25 17:52:23 Karthick Ram
its correcr oly.... we need to find the next palindome
2014-07-25 17:30:29 .:: Jarv1s ::.
Got AC finally! hurray! I was failing for 100100 as an input.

Last edit: 2014-07-25 18:12:22
2014-07-21 16:28:30 Zishan Ahmad
what is the upper limit of t ?
2014-07-20 18:11:52 Michael Moerschell

Last edit: 2014-07-20 18:21:30
2014-07-13 06:38:05 Yevgen Yampolskiy
WARNING: last line does not have terminating '\n'. If you implement your own I/O library then you may run into an issue (as I did)

Last edit: 2014-07-13 17:43:42
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.