diff --git a/src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_1.java b/src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_1.java new file mode 100644 index 00000000..86e00a02 --- /dev/null +++ b/src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_1.java @@ -0,0 +1,28 @@ +package ru.tn.courses.vmartinov.v3.task1; + +import java.util.Arrays; + +public class Subtask_1 { + public static void main(String[] args) { + int[] arrayNumbers = {0,0,0,1,-2, 3,-4, 5,-6,7}; + for (int i = 0; i 0) + { + System.out.println("Первое число положительное"); + } + else { + System.out.println("Перврое число отрицательное"); + } + break; + } + } +} diff --git a/src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_2.java b/src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_2.java new file mode 100644 index 00000000..e2044fb7 --- /dev/null +++ b/src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_2.java @@ -0,0 +1,32 @@ +package ru.tn.courses.vmartinov.v3.task1; + +import java.util.Arrays; + +public class Subtask_2 { + public static void main(String[] args) { + int[] arrayNumbers = new int[10]; + int[] lock = new int[]{0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; + int first_cube = 0; + int second_cube = 0; + for (int i = 0; i < arrayNumbers.length; i++) { + if (arrayNumbers[i] > 0) { + if (first_cube == 0) + first_cube = i; + else + second_cube = i; + } + } + int[] decrypt = new int[3]; + decrypt[first_cube % 3] = arrayNumbers[first_cube]; + if (arrayNumbers[first_cube] == arrayNumbers[second_cube]) + decrypt[(first_cube + 1) % 3] = (10 - arrayNumbers[first_cube] - arrayNumbers[second_cube]) / 2; + else + decrypt[(first_cube + 1) % 3] = arrayNumbers[second_cube]; + decrypt[(first_cube + 2) % 3] = 10 - arrayNumbers[first_cube] - decrypt[(first_cube + 1) % 3]; + + for (int i = 0; i < lock.length; i++) { + lock[i] = decrypt[i % 3]; + } + System.out.println(Arrays.toString(lock)); + } +} diff --git a/src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_3.java b/src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_3.java new file mode 100644 index 00000000..41be5417 --- /dev/null +++ b/src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_3.java @@ -0,0 +1,24 @@ +package ru.tn.courses.vmartinov.v3.task1; + +public class Subtask_3 { + public static void main(String[] args) + { + int[] arrayNumbers = {12,9,4,25,84,48,74,100}; + int count = 0; + for (int i = 0; i < arrayNumbers.length - 1; i++) + for (int j = 0; j < arrayNumbers.length - i - 1; j++) + if (arrayNumbers[j] > arrayNumbers[j+1]) + { + int temporary = arrayNumbers[j]; + arrayNumbers[j] = arrayNumbers[j+1]; + arrayNumbers[j+1] = temporary; + count++; + } + System.out.println("Отсортированный массив:"); + for(int i=0; i