n=eval(input())
a=list(map(int,input().split(",")))
a.remove(max(a))
a.remove(min(a))sum=0for i in a:sum+= i
ave =float(sum/(n-2))
cnt =0for i in a:if i<ave:
cnt+=1print("此人最终得分是:{:.3f},有{:d}个低于平均值的成绩。".format(ave, cnt))
八、矩阵相加
n=int(input())
a=[]for i inrange(n):
s1=input()
a.append([int(n)for n in s1.split()])
b=[]for i inrange(n):
s2=input()
b.append([int(n)for n in s2.split()])for i inrange(n):for j inrange(n):
t=a[i][j]+ b[i][j]if(j==n-1):print("{:^3d}".format(t),end=" ")else:print("{:^3d}".format(t), end=" ")print(end="\n")
九、寻找最佳组合
n =eval(input())
s =list(map(int,input().split(",")))
a =[]for i inrange(len(s)):
t =[]if s[i]==9:
t.append(s[i])
a.append(t)for i inrange(len(s)):
t =[]
flag =0for j inrange(i+1,len(s)):if s[i]+s[j]==9and s[i]!=0and s[j]!=0:
flag=1
t.append(s[i])
t.append(s[j])if flag ==1:
a.append(t)for i inrange(len(s)):for j inrange(i+1,len(s)):
t =[]
flag =0for k inrange(j+1,len(s)):if s[i]+s[j]+s[k]==9and s[i]!=9and s[j]!=9and s[k]!=9:
flag =1
t.append(s[i])
t.append(s[j])
t.append(s[k])if flag==1:
a.append(t)print(a)
十、单词的区域
s =list(input().split())
re =['q','w','e','a','s','d','z','x','c','Q','W','E','A','S','D','Z','X','C']
bl =['r','t','y','f','g','h','v','b','n','R','T','Y','F','G','H','V','B','N']
ye =['u','i','o','p','j','k','l','m','U','I','O','P','J','K','L','M']
words={}
pre=[]for i in s:
cnt=0for j in i:if j in re:
cnt +=1if cnt==len(i):
pre.append(i)
pbl=[]for i in s:
cnt=0for j in i:if j in bl:
cnt +=1if cnt==len(i):
pbl.append(i)
pye=[]for i in s:
cnt=0for j in i:if j in ye:
cnt +=1if cnt==len(i):
pye.append(i)
words['Red']= pre
words['Blue']= pbl
words['Yellow']= pye
print(words)
文章目录Python字典练习【第九周】六、金币排列七、歌咏小能手八、矩阵相加九、寻找最佳组合十、单词的区域Python字典练习【第九周】六、金币排列n=eval(input())a=[]j,k=-1,-1cnt,res=0,0for i in range(1,n): a.append(i)while True: j+=1 cnt=a[j]+cnt if(cnt>=n): breakif(sum(a[:3])==n): prin