/
javapractice
/
JavaPractice
Обзор
Документация
Войти
/
javapractice
/
JavaPractice
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
2
CI/CD
Аналитика
develop
CodeRun/src/test/java/quickStart/QuickStartExercise10Test.java
43 строки
2 KB
Кузьма U600DEV Даждъбогин
f/TSKJVPRCTC5-16 теория чисел - эвклид Наименьший общий Делитель и Кратное
23 янв 2026, 12:26
23 янв 2026, 12:26
22719c1
Код
Авторство
О чём код?
package quickStart; import org.junit.jupiter.api.Test; import static org.junit.jupiter.api.Assertions.*; public class QuickStartExercise10Test { @Test public void testGetEuclidesWithPositiveNumbers() { long[] result = QuickStartExercise10.getEuclides("12 18"); assertEquals(6, result[0], "GCD of 12 and 18 should be 6"); assertEquals(36, result[1], "LCM of 12 and 18 should be 36"); } @Test public void testGetEuclidesWhenFirstNumberIsSmaller() { long[] result = QuickStartExercise10.getEuclides("8 12"); assertEquals(4, result[0], "GCD of 8 and 12 should be 4"); assertEquals(24, result[1], "LCM of 8 and 12 should be 24"); } @Test public void testGetEuclidesWhenNumbersAreEqual() { long[] result = QuickStartExercise10.getEuclides("7 7"); assertEquals(7, result[0], "GCD of 7 and 7 should be 7"); assertEquals(7, result[1], "LCM of 7 and 7 should be 7"); } @Test public void testGetEuclidesWhenOneNumberIsOne() { long[] result = QuickStartExercise10.getEuclides("1 15"); assertEquals(1, result[0], "GCD of 1 and 15 should be 1"); assertEquals(15, result[1], "LCM of 1 and 15 should be 15"); } @Test public void testGetEuclidesWithLargeNumbers() { long[] result = QuickStartExercise10.getEuclides("1071 462"); assertEquals(21, result[0], "GCD of 1071 and 462 should be 21"); assertEquals(23562, result[1], "LCM of 1071 and 462 should be 23562"); } }