| 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
|
||||||||||||||
|
2014-01-15 15:17:31 garretthh07
oh!!I think my methods is ok,but it gets wrong!! |
||||||||||||||
|
2014-01-15 15:17:31 Udaybhanu Sanyal
god knows y my code not working...working fyn in my pc tho... |
||||||||||||||
|
2014-01-15 15:17:31 (Tjandra Satria Gunawan)(曾毅昆)
Finaly AC after 9x WA.... :D This is very easy problem(?) |
||||||||||||||
|
2014-01-15 15:17:31 Abhishek Kumar
@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. |
||||||||||||||
|
2014-01-15 15:17:31 Remi
@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` |
||||||||||||||
|
2014-01-15 15:17:31 sam
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 |
||||||||||||||
|
2014-01-15 15:17:31 nik
Yep, brute function was good idea, thanks. |
||||||||||||||
|
2014-01-15 15:17:31 Alexander Bagnall
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 |
||||||||||||||
|
2014-01-15 15:17:31 Ilya
How large can the number of inputs (t) be? |
||||||||||||||
|
2014-01-15 15:17:31 Hermano
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. :/ |
||||||||||||||
RSS