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 8 9 10 11 12 13 14 15 16 17 18 Next >

	deep123r: 2019-02-14 17:14:15 Check for these things 1. Check for Corner Cases(i.e. -all digits are 9 only) ,eg for 99,999,9999,99999(for these just add 2 to the numbers) 2. Leading Zeroes are no problem,e.g. for 000001=001100 is acceptable and 2 is also acceptable.
	mighty_joe781: 2019-02-12 07:42:13 I am also getting TLE any ideas.
	randm_codr_rs: 2019-02-05 14:15:20 I'm getting runtime error NZEC in this problem while submitting but perfectly running on ideone platform
	venom_black: 2019-01-18 14:37:29 too hard
	gjenkinsedu: 2019-01-17 23:43:55 I have written a C version that passes with all test data on SPOJToolkit, and I have hand tested it with numbers of more than 10000 digits and it works fine. but It still fails on SPOJ with wrong results. Any suggestions or places with more extensive test cases
	squirrelli: 2019-01-03 14:02:41 If input is 010,000, isn't the output 10,001?
	sehgal_divij: 2019-01-02 13:21:19 runs on my machine but fails here. note that I am using -std=c++11 flag while compiling on my device. It works on my device but fails with the following error here: runtime error(SIGABRT) Works on ideone Suggestions on what to do? Link to working version on ideone: <snip> Last edit: 2022-07-26 22:15:37
	nitin_uniyal: 2018-12-23 05:14:36 running time 0.56 s. Don't convert the string to int or long int anywhere. Strip the input to remove '\n'. Use the list of string characters because strings are immutable in nature. Characters Consider all cases e.g. '0', '9',' 99', '1991' etc.
	spyhawk_74: 2018-12-22 12:59:57 Finally ACed in 9th attempt. For future solvers:: Make sure you do not give up. It will take time, For me it was roughly 8 hours. A good ad hoc problem. Make sure that you implement your logic properly.
	Maneesh Sharma: 2018-12-18 10:11:49 If k is 999, should the output be 1001 ? Last edit: 2018-12-18 10:12:34