update

Author: Aleksandr Pronichev

app/src/main/java/hexlet/code/games/GCD.java

@@ -1,11 +1,13 @@
 package hexlet.code.games;
 
 import hexlet.code.Engine;
+import hexlet.code.Utils;
 
 public class GCD {
 
     private static final String RULES = "Find the greatest common divisor of given numbers.";
     private static final int MAX_NUMBER = 100;
+    private static final int MIN_NUMBER = 1;
 
     public static void gameGCD() {
         String[][] questionsAndAnswers = generateData();
@@ -16,8 +18,8 @@ public static String[][] generateData() {
         String[][] questionsAndAnswers = new String[Engine.ROUNDS][2];
 
         for (int i = 0; i < Engine.ROUNDS; i++) {
-            int firstNumber = (int) (Math.random() * MAX_NUMBER);
-            int secondNumber = (int) (Math.random() * MAX_NUMBER);
+            int firstNumber = Utils.getRandomInt(MIN_NUMBER, MAX_NUMBER);
+            int secondNumber = Utils.getRandomInt(MIN_NUMBER, MAX_NUMBER);
             String question = firstNumber + " " + secondNumber;
 
             int gcd = calculateGCD(firstNumber, secondNumber);

app/src/main/java/hexlet/code/games/Prime.java

@@ -1,11 +1,13 @@
 package hexlet.code.games;
 
 import hexlet.code.Engine;
+import hexlet.code.Utils;
 
 public class Prime {
 
     private static final String RULES = "Answer 'yes' if given number is prime. Otherwise answer 'no'.";
     private static final int MAX_NUMBER = 100;
+    private static final int MIN_NUMBER = 1;
 
     public static void gamePrime() {
         String[][] questionsAndAnswers = generateData();
@@ -16,7 +18,7 @@ public static String[][] generateData() {
         String[][] questionsAndAnswers = new String[Engine.ROUNDS][2];
 
         for (int i = 0; i < Engine.ROUNDS; i++) {
-            int number = (int) (Math.random() * MAX_NUMBER);
+            int number = Utils.getRandomInt(MIN_NUMBER, MAX_NUMBER);
             questionsAndAnswers[i][0] = Integer.toString(number);
             if (isPrime(number)) {
                 questionsAndAnswers[i][1] = "yes";