61.列表差异
l1=input().split()
l2=input().split()
l=list()
len_1=len(l1)
len_2=len(l2)
for i in range(len_1):
if l1[i] in l2:
continue
else:
l.append(l1[i])
for i in range(len_2):
if l2[i] in l1:
continue
else:
l.append(l2[i])
print(" ".join(l))
62.排序II
l = input().split(",")
len_l = len(l)
for i in range(len_l):
l[i] = l[i][1:]
for i in range(len_l):
l[i]=int(l[i])
l.sort()
for i in range(len_l):
l[i] = "a" + str(l[i])
print(" ".join(l))
63.反转元组
l=input().split()
len_l=len(l)
L=sorted(l,reverse=True)
for i in range(len_l):
l[i]=int(l[i])+int(L[i])
print(tuple(l))
64.排序III
样例:(1,105);(2,102);(3,104);(4,103);(5,101)
l = input().split(";")
len_l = len(l)
for i in range(len_l):
l[i] = tuple(str(l[i])[1:-1].split(","))
L = [(int(x), int(y)) for x, y in l]
for i in range(len_l):
for j in range(i, len_l):
if L[i][1] > L[j][1]:
L[i], L[j] = L[j], L[i]
print(L)
65.列表切片
m,n=map(int,input().split())
l=input().split()
len_l=len(l)
for i in range(len_l):
l[i]=int(l[i])
print(l[m:n])
66.元组重复项
n=input()
l=input().split()
j=0
len_l=len(l)
for i in range(len_l):
if l[i]==n:
j=j+1
print(j)
67.重复字符
样例:googleapplemicrosoft
s = input()
char_count = {}
# 计算每个字符的出现次数
for char in s:
if char in char_count:
char_count[char] += 1
else:
char_count[char] = 1
# 过滤出出现次数大于1的字符
com_chars = [char for char, count in char_count.items() if count != 1]
# 按照字符在字符串中出现的顺序对 com_chars 进行排序
com_chars.sort(key=s.index)
# 打印每个非唯一字符及其出现次数
for char in com_chars:
print(char, char_count[char])
68.元素相乘
l=input().split()
len_l=len(l)
j=1
for i in range(len_l):
l[i]=int(l[i])
for i in range(len_l):
j=j*l[i]
print(j)
69.排序I
样例:-1 -67 92 36 99 44 66 -55 2 0 12 10
l=input().split()
len_l=len(l)
for i in range(len_l):
l[i]=int(l[i])
l.sort(reverse=True)
for i in range(len_l):
l[i]=str(l[i])
print(" ".join(l))
70.循环相同
l1=input().split()
l2=input().split()
l1="".join(l1)
l2="".join(l2)
L1=[]
L2=[]
for i in range(len(l1)):
L1.append(l1[1:]+l1[0])
l1=l1[1:]+l1[0]
for i in range(len(l2)):
L2.append(l2[1:]+l2[0])
l2=l2[1:]+l2[0]
if set(L1)==set(L2):
print("True")
else:
print("False")