打印所有不超过n(取n<256) 的其平方具有对称性质的数(也称回文数)。

*题目分析与算法设计

对于要判断的数n，计算出其平方后(存于a)，将a的每一位进行分解，再按a的从低到高的顺序将其恢复成一个数k(如n=13，则a=169且k=961)，若a等于k则可判定n为回亠数。

-Print all over n (4 admission; 256) with the square of its symmetrical nature of the (also known palindrome numbers). * Topic analysis and design algorithms for determining the number n, calculated after its square (on a), a one for each of decomposition, according to a from low to high in the order of their resume into a few k (n = 13, a = 169 where k = 961) if a mean k n can be found to back Tou few.