老师让我们写个回文数的小程序，* 题目分析与算法设计

对于要判断的数n，计算出其平方后(存于a)，将a的每一位进行分解，再按a的从低到高的顺序将其恢复成一个数

k(如n=13，则a=169且k=961)，若a等于k则可判定n为回文数。-Let the teacher write a palindromic number of small programs,* the subject analysis and algorithm design is to determine the number of n, calculate its square later (stored in a), will be a break down of each one, and then a from the low to high order to restore it into a number k (eg n = 13, then a = 169 and k = 961), if a is equal to k can be found n the number of the palindrome.