演示如何使用循环和ifs模拟多次滚动单个模具的结果

2024-09-27 23:21:03 发布

您现在位置:Python中文网/ 问答频道 /正文

分配如下,只是寻找如何跟踪滚动编号出现次数的指导,这是我到目前为止所做的,我正在编写一个简单的猜测游戏程序。任何指导/解释都很好。不查找整个代码或答案的文本。我只需要了解如何跟踪和实现计数器代码。以下是我所拥有的:

一个简单的模拟,可以帮助显示任何模具表面值的概率是相等的

随机输入

NumberToGuess=(random.randint(1,6)) 打印('骰子卷是'+str(NumberToGuess))

GuessRoll=input('掷骰子需要掷骰子多少次:') GuessRoll=int(GuessRoll)

while(GuessRoll!=NumberToGuess):

if (GuessRoll > NumberToGuess):
    print ('Guess is TOO high ')
else:
    print ('Guess is TOO low ')
GuessRoll = input('Guess the number: ')
GuessRoll = int(GuessRoll)

打印('你是赢家!!')

  1. 询问用户模具需要滚动多少次。此值应存储在 适当的变量
  2. 循环必须按照1中指定的用户次数执行。上面
  3. 在循环内部,将生成一个介于1和6(包括)之间的随机数
  4. 记录一个数字出现的次数。一个简单的方法是使用一个变量 (a)每个模具值的计数器。生成随机模具辊时,相应的计数器 增加1。例如,您可以有一个名为Roll1的变量来跟踪 滚动1的次数。每次滚动1时,变量中都会添加1
  5. 循环结束时,屏幕上会显示一份报告,显示每个模具值的计数。 应以用户友好的方式显示6个值。就像简单的输出看起来一样 这: 卷取1的次数:xx 轧制2的次数:xx 轧制3的次数:xx 轧制4的次数:xx 轧制5的次数:xx 轧制6的次数:xx 其中xx是特定数字出现的总次数

Tags: 代码用户inputis计数器次数inttoo
1条回答
网友
1楼 · 发布于 2024-09-27 23:21:03

我做到了! 我做了很多尝试和错误,复习了很多关于while和if循环等的教程,但是我得到的速度很慢,但很肯定

Counter = 1
Counter1 = 0
Counter2 = 0
Counter3 = 0
Counter4 = 0
Counter5 = 0
Counter6 = 0

RollNumber = input('How Many Times Do You Want To Roll The Dice: ')
RollNumber = int(RollNumber)

import random

while Counter <= RollNumber:
   DieRoll = (random.randint(1,6))
   Counter = Counter + 1
if DieRoll == 1:
    Counter1 = Counter1 + 1
if DieRoll == 2:
    Counter2 = Counter2 + 1
if DieRoll == 3:
    Counter3 = Counter3 + 1
if DieRoll == 4:
    Counter4 = Counter4 + 1
if DieRoll == 5:
    Counter5 = Counter5 + 1
if DieRoll == 6:
    Counter6 = Counter6 + 1
print ('Number 1 was rolled this many times:')
print (Counter1)
print ('Number 2 was rolled this many times:')
print (Counter2)       
print ('Number 3 was rolled this many times:')
print (Counter3)
print ('Number 4 was rolled this many times:')
print (Counter4)
print ('Number 5 was rolled this many times:')
print (Counter5)
print ('Number 6 was rolled this many times:')
print (Counter6)

print ('Thanks For Playing The Dice Roll Simulator')

相关问题 更多 >

    热门问题