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.


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

hide comments
Utkarsh: 2014-08-26 15:39:54

What should be the output in case of single digit integers?

Leppy: Why should one digit be handled differently than 3 or 5 or 1000000 digits?

Last edit: 2014-08-27 18:21:09
Nazib Sorathiya: 2014-08-24 15:13:05

Time Limit Exceeded !!!!!!!
Common in my system there is no time lag for output and also on terminal for gcc)time shown is 0,then how come time limit is exceeding

GURUPREET SINGH: 2014-08-22 20:39:44

do we need to consider 0 as an input??

(reply by cyclops) Positive means greater than zero.

Last edit: 2014-08-22 23:00:56
Hidenori: 2014-07-30 00:50:18

It's very easy to write bruteforce solution, so it was really easy to test!

LeppyR64: 2014-07-27 17:31:11

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"

Nakul Mohan: 2014-07-26 20:52:06

nice problem...AC finally :)

Zishan Ahmad: 2014-07-21 16:28:30

what is the upper limit of t ?

Yevgen Yampolskiy: 2014-07-13 06:38:05

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
Wasim Thabraze: 2014-07-05 12:36:16

Huh! Finally AC after a 24hr struggle!

Last edit: 2014-07-06 05:59:45
Mitch Schwartz: 2014-06-26 21:40:34

@ankush: There is no such feature. (This is mentioned at -- "Input and output data used by SPOJ judge to decide whether your solution is correct or not are set by problem-setter (person who adds problems) and are hidden. Many of problems has tricky test data so the ability to form you own and comprehensive test cases is very useful.")

Added by:adrian
Time limit:2s-9s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL6

Problem's scores 1 vote

Concept difficulty
Concept difficulty 37%
Implementation difficulty
Implementation difficulty 50%
458 16