#第一题AC,判断是否是回文链表 def huiwen(l): length = len(l) for i in range(length): if l[i] != l[length-i-1]: return False else: return True l = map(int,raw_input().split(' ')) res = huiwen(l) print res #第二题,小米和大米 def happy(l): length = len(l) xaiovalue = 0 d...