SPOJ.com - Problem PALIN

PALIN - The Next Palindrome

#ad-hoc-1

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

Submit solution!

hide comments

< Previous 61 62 63 64 65 66 67 68 69 70 71 Next >

	garretthh07: 2014-01-15 15:17:31 oh!!I think my methods is ok,but it gets wrong!!
	Udaybhanu Sanyal: 2014-01-15 15:17:31 god knows y my code not working...working fyn in my pc tho...
	(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†): 2014-01-15 15:17:31 Finaly AC after 9x WA.... :D This is very easy problem(?)
	Abhishek Kumar: 2014-01-15 15:17:31 @chirag SIGSEGV (signal 11) - the most common error for non-interpreted languages: a "segmentation fault" of the program. This may be caused e.g. by an out-of-scope array index causing a buffer overflow, an incorrectly initialized pointer, etc.
	Remi: 2014-01-15 15:17:31 @sam It depends on your term. Printing in your term may take long. Try with a redirection of stdout to /dev/null to get the 'real' time. Like this : `1>/dev/null`
	sam: 2014-01-15 15:17:31 Need help with solving this problem using python! my solution is fine it seems, i see the bottle neck with IO : most of my time goes in outputting the HUGE 1M digit number to my console.. with a single 1M digit input i am clocking 17 secs.. any suggestions/ideas? Last edit: 2012-03-17 09:30:38
	nik: 2014-01-15 15:17:31 Yep, brute function was good idea, thanks.
	Alexander Bagnall: 2014-01-15 15:17:31 I'm also getting "wrong answer" from the judge. Sure, my algorithm is not very fast but it gives the correct output when I run it on my computer. :( Edit - Ah! I just had to input the values as strings so it would accept such large values. Getting TLE as expected now. :) Last edit: 2012-01-14 03:22:00
	Ilya: 2014-01-15 15:17:31 How large can the number of inputs (t) be?
	Hermano: 2014-01-15 15:17:31 I didn't read the problem carrefully. I thought it'd be 1 000 000 the max k value. But not... k can have almos 10^1000000 digits. I can't make a code to execute the mirror thing fast enough. My code must increment a giant string representation of a integer, and compare theses represetations. And I keep getting tle. :/