此 blog 已弃。
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.
The first line contains integer t, the number of test cases. Integers K are given in the next t lines.
For each K, output the smallest palindrome larger than K.
Input:28082133
Output:8182222
posted on 2012-02-19 16:18 coreBugZJ 阅读(358) 评论(0) 编辑 收藏 引用 所属分类: ACM 、Algorithm 、Lisp
Powered by: C++博客 Copyright © coreBugZJ