import random
x=0
c=0
print("一天你买了亿张彩票")
for i in range(0,100000000):
b = int(random.uniform(1, 12))
if b==1 or b==5 or b==6 or b==7 or b==8 or b==9:
x = input("按任意键刮开第一个数")
print("谢")
x = input("按任意键刮开第二个数")
print("谢")
x = input("按任意键刮开第三个数")
print("会")
x = input("按任意键刮开第四个数")
print("顾")
print("再来一张")
elif b==2 or b==12:
x = input("按任意键刮开第一个数")
print("您")
x = input("按任意键刮开第二个数")
print("中")
x = input("按任意键刮开第三个数")
print("奖")
x = input("按任意键刮开第四个数")
print("了")
print("再来一张")
elif b == 3:
x = input("按任意键刮开第一个数")
print("谢")
x = input("按任意键刮开第二个数")
print("谢")
x = input("按任意键刮开第三个数")
print("中")
x = input("按任意键刮开第四个数")
print("奖")
print("再来一张")
elif b == 4 or b==10 or b==11:
x = input("按任意键刮开第一个数")
print("再")
x = input("按任意键刮开第二个数")
print("来")
x = input("按任意键刮开第三个数")
print("一")
x = input("按任意键刮开第四个数")
print("张")
print("--------------------------------------------")
童小纯
- 粉丝: 3w+
- 资源: 289
最新资源
- 基于JavaScript的Project-3项目设计源码
- 基于Java语言的新能源汽车实时数仓设计源码
- java-leetcode题解之Longest Chunked Palindrome Decomposition.java
- java-leetcode题解之Longest Arithmetic Subsequence of Given
- java-leetcode题解之Linked List Random Node.java
- java-leetcode题解之Linked List Components.java
- java-leetcode题解之Letter Case Permutation.java
- java-leetcode题解之Length of Longest Fibonacci Subsequence.java
- gdut_numerical_analysis-matlab下载
- 基于Java的高性能简单实用MQTT服务器设计源码
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈