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
hide comments
|
RUBAL GUPTA:
2014-09-21 20:54:45
plzz help
|
|
|
RUBAL GUPTA:
2014-09-21 20:54:30
my code is working in codeblock bt showing wrong anwer at sumbit
|
|
lyn:
2014-09-18 04:42:57
AC finally as a SPOJ newbie.. the source code can be fairly simple if the correct strategy is chosen .. and as the guys have already pointed out, the 'integer K of not more than 1000000 digits' indicates using atoi only yields WA |
|
dante:
2014-09-15 09:53:06
why its showing wrong answer? its running perfectly in borland c++, dev c++ and gcc in linux.
|
|
Ignacio Cortorreal:
2014-09-14 22:47:42
As Yevgen Yampolskiy said, last line does not have terminating '\n'. I'll consider that on next problems. :P |
|
|
Ignacio Cortorreal:
2014-09-14 17:23:05
Why is this answer wrong?
|
|
akash agrawal:
2014-09-14 00:49:53
code is running successfully in ideone but
|
|
Vishal:
2014-09-08 16:11:17
Running in ideone with time 0.11 here it shows time limit exceeded plz help
|
|
manasniec19@gmail.com:
2014-09-01 16:58:12
constraint on no of test cases?? Last edit: 2014-09-01 16:58:39 |
|
sitaram:
2014-08-28 21:45:58
running in codeblock...........but showing wrong answer here
|
| 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 |
RSS