PAT-python-1136 A Delayed Palindrome

Sample Input 1:
97152

Sample Output 1:
97152 + 25179 = 122331
122331 + 133221 = 255552
255552 is a palindromic number.

Sample Input 2:
196

Sample Output 2:
196 + 691 = 887
887 + 788 = 1675
1675 + 5761 = 7436
7436 + 6347 = 13783
13783 + 38731 = 52514
52514 + 41525 = 94039
94039 + 93049 = 187088
187088 + 880781 = 1067869
1067869 + 9687601 = 10755470
10755470 + 07455701 = 18211171
Not found in 10 iterations.

解法

这题主要是n和它的倒序序列相加的时候可能是大数相加，那么注意进位。（其实就是n的第i位与第len-1-i位相加再加前一位的进位）。

def add_big(a):
    ans = []
    size = len(a)
    cnt = 0
    for i in range(size):
        sum = int(a[i]) + int(a[size - 1 - i]) + cnt
        ans.append(str(sum % 10))
        cnt = sum // 10
    if cnt > 0:
        ans.append(str(cnt))
    return "".join(ans[::-1])

n = input()
for i in range(10):
    if n == n[::-1]:
        print(n + " is a palindromic number.")
        exit(0)
    else:
        ans = add_big(n)
        print(n + " + " + n[::-1] + " = " + ans)
        n = ans
print("Not found in 10 iterations.")