Skip to content

Лабораторная работа №1 #8

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 28 additions & 0 deletions src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_1.java
Original file line number Diff line number Diff line change
@@ -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<arrayNumbers.length; i++){
System.out.print(arrayNumbers[i] + " ");
}
System.out.println("=================================");

for (int i = 0; i < arrayNumbers.length; i++)
{
if (arrayNumbers[i] == 0){
continue;
}
else if (arrayNumbers[i] > 0)
{
System.out.println("Первое число положительное");
}
else {
System.out.println("Перврое число отрицательное");
}
break;
}
}
}
32 changes: 32 additions & 0 deletions src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_2.java
Original file line number Diff line number Diff line change
@@ -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));
}
}
24 changes: 24 additions & 0 deletions src/main/java/ru/tn/courses/vmartinov/v3/task1/Subtask_3.java
Original file line number Diff line number Diff line change
@@ -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<arrayNumbers.length; i++){
System.out.print(arrayNumbers[i] + " ");
}
System.out.println("=================================");
System.out.println("Количество перестановок: "+ count);
}
}