Commit 993f614f by BellCodeEditor

auto save

parent c0b5d117
Showing with 68 additions and 11 deletions
if player==computer:
print("平局")
elif player=="石头"and computer=="剪刀":
print("恭喜,你赢了")
elif player=="剪刀"and computer=="布"
print("恭喜,你赢了)
elif player==""and computer=="石头":
print("恭喜你,你赢了")
else:
print("很遗憾,你输了")
\ No newline at end of file
# a=[1,2,3,4]
# append()
# insert(-1,'wo')
# extend() +
# pop(0)
# remove(4)
# clear()
# del a
# a[1]='123'
# for i in range(10):
# a='123qweqwe'
# b=a.split('w')
# print(b)
# a=list(a)
# a.insert(3,'4')
# print(a)
# b=''.join(a)
# print(b,type(b))
# a=input("输入每个人的分数,空格隔开")
# b=a.split(',')
# l=[]
# for i in b:
# l.append(int(i))
# a=[1,2,3,4,5]
# a.remove(max(a))
# a.remove(min(a))
# print(sum(a)/len(a))
#元组, 不可修改
# a=1,2,3,4
# print(a,type(a))
# a={
# '1':21,
# '2':34,
# 12:89
# }
# a['1']=90
# a['111']=90
# print(a)
#集合,集合里面的数据不重复
# a=[1,2,1,2,3,4,1,2,3,1,24,12,4,1,1,1]
# a=tuple(a)
# # a={1,2,3,12,3,1,3,12,3,123,'123','123'}
# print(a)
def a(n):
s=a(n-1)+n
if n==1:
return 1
return s
print(a(100))
# for i in a:
# b=a.count(i)
# for j in range(b-1):
# a.remove(i)
# print(a)
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