def palindrome(n): s = str(n) m = '' for ch in s: m = ch + m return m == s
def pp(n): l=[] while n>0: l.append(n%10) n=n//10 for i in range(len(l)//2): if l[i] != l[len(l) - i - 1]: return False return True
def is_palindrome(n): return str(n)==str(n)[::-1]
Sign in to make a reply
米粽粽