Submit | All submissions | Best solutions | Back to list |
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.
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
Added by: | adrian |
Date: | 2004-05-01 |
Time limit: | 2s-9s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: NODEJS PERL6 |
hide comments
|
||||||||||||||
2015-04-11 00:23:28 Punit Bhatt
My submission is not getting accepted but "runtime error (SIGSEGV)" is being displayed. Can someone please explain what this means ?? When i tested the program, the outputs were right. But still this error is being displayed. |
||||||||||||||
2015-04-04 18:22:02 Asad Rahman
Great problem...basically its all about nine :) |
||||||||||||||
2015-04-04 14:47:33 Kyezil
You have to print the NEXT palindrome whether the current number is or not. |
||||||||||||||
2015-04-04 12:50:55 CHRIS
why 808 isint a pallindrom |
||||||||||||||
2015-04-04 07:57:55 Subham
It is giving right output, but don't why is telling wrong answer. <snip> Last edit: 2022-07-26 22:29:26 |
||||||||||||||
2015-04-03 03:45:16 hanliyao
i guess: the positive integer k of not more than 1000000 digits is something about the length of the K |
||||||||||||||
2015-03-31 14:59:22 im9
Is it necessary to use vectors? |
||||||||||||||
2015-03-30 17:53:16 sughosh v kaushik
Should I use BigInteger for this problem or int is enough?Its giving me NZEC |
||||||||||||||
2015-03-27 19:03:17 VigneshR
http://ideone.com/******** It shows wrong answer. I have checked all sort of inputs. If anyone point at a test case where it fails would be good. Without knowing what is the issue is makes SPOJ a real frustration. Last edit: 2015-03-29 18:32:17 |
||||||||||||||
2015-03-26 23:45:06 Ilya Tetin
Getting TLE in Java. :( I'm using BufferedReader(new InputStreamReader(System.in)) to read the input character by character, and not expecting a newline at the end. I actually did test it on my local machine with a slower processor with an input file containing multiple integers with 100000 digits , and it finished in split-second. |