File tree Expand file tree Collapse file tree 2 files changed +5
-7
lines changed Expand file tree Collapse file tree 2 files changed +5
-7
lines changed Original file line number Diff line number Diff line change 33<a href =" https://codeclimate.com/github/Vitaliy-Berezhnoy/python-project-49/maintainability " ><img src =" https://api.codeclimate.com/v1/badges/3e3c695d3a98ff59c1d0/maintainability " /></a >
44<a href =" https://asciinema.org/a/9Skt2FbW7LSCkBky9LgDa7NLe " target =" _blank " ><img src =" https://asciinema.org/a/9Skt2FbW7LSCkBky9LgDa7NLe.svg " /></a >
55
6- <a href =" https://asciinema.org/a/697024 " target =" _blank " ><img src =" https://asciinema.org/a/697024.svg " /></a >
7- A demonstration. The game is to find the greatest common divisor.
8- <a href =" https://asciinema.org/a/697048 " target =" _blank " ><img src =" https://asciinema.org/a/697048.svg " /></a >
96
10- Demonstration of the arithmetic progression game
11- <a href =" https://asciinema.org/a/697128 " target =" _blank " ><img src =" https://asciinema.org/a/697128.svg " /></a >
7+ ** Demonstration of different outcomes of games.**
8+
9+ <a href =" https://asciinema.org/a/697210 " target =" _blank " ><img src =" https://asciinema.org/a/697210.svg " /></a >
Original file line number Diff line number Diff line change @@ -14,7 +14,7 @@ def nod(a, b): # нахождение наибольшего общего
1414questions = []
1515right_answer = []
1616for _ in range (3 ):
17- num1 = randint (1 , 1000 )
18- num2 = randint (1 , 1000 )
17+ num1 = randint (1 , 10 )
18+ num2 = randint (1 , 10 )
1919 questions .append (f"{ num1 } { num2 } " )
2020 right_answer .append (str (nod (num1 , num2 )))
You can’t perform that action at this time.
0 commit comments