Commit d9fedd2d by BellCodeEditor

save project

parent a72e6742
Showing with 57 additions and 17 deletions
# 古代测量臂力是靠不同重量的石锁,只能测整数哦。
# 最小的石锁是30公斤最大的石锁是100公斤,注意输入的数字哦。
# 请优化刚刚的代码,并增添交互效果,和自动输出最强三人信息的功能~
# 问询处
s = input("名字?")
b = int(input("力量💪?"))
# 归档处
hero=['赵一',30,'丁二',37,'孙五',52,'王猛',89,'周亮',98,'张宇',100]
for i in range(1,len(hero),2):
if hero[i]>b:
hero.insert(i-1,s)
hero.insert(i,b)
break
# 打印出臂力最强的三个人和他们对应的臂力值:
print(hero[len(hero)-6:])
\ No newline at end of file
# a=int(input("输入一个数"))
# q=0
# while a>1:
# q+1
# if a%2==0:
# a/=2
# else:
# a*=3+1
# print(a)
# k=[]
# a=0
# for i in range(1,5):
# for j in range(1,5):
# if j==i:
# continue
# for g in range(1,5):
# continue
# k.append(i*100+j*10+g*1)
# a=a+1
# if g==i or g==j:
# print(k)
k=[]
a=0
# for i in range(1,7):
# for j in range(1,7):
# if j==i:
# continue
# for p in range(1,7):
# if p==i:
# continue
# for g in range(1,7):
# continue
# k.append(i*1000+p*100+j*10+g*1)
# a=a+1
# if g==i or g==j or g==p:
# print(k)
q=1
for i in range(1,101):
w=1
for in range(1,i+1):
q*=1
print(w)
print(sum)
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or sign in to comment