mirror of
https://github.com/ASDjonok/OOP_IO-2x_2023.git
synced 2026-04-21 21:34:35 +03:00
Compare commits
39 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
| 4be9e7b1ba | |||
| d1e20c015c | |||
| ad7b0175ba | |||
| c62613c975 | |||
| c95a243c84 | |||
| 63b1b6f62b | |||
| 1c68762d9d | |||
| ba82b49508 | |||
| ee35a832b9 | |||
| 7e652a976c | |||
| 15685384a7 | |||
| e6620839bd | |||
| f136101a3b | |||
| 59fb75ce32 | |||
| b9570d75f8 | |||
| ae0f85c8d6 | |||
| 96dd638e66 | |||
| 61760443a5 | |||
| 8b517d136f | |||
| 9813f75326 | |||
| 8ae3907d24 | |||
| a011fc41cf | |||
| 4454d46284 | |||
| 4d70c6a51e | |||
| 8db686fac0 | |||
| a48fb7d41f | |||
| 09f2114de6 | |||
| 828dedc3b6 | |||
| 41b6eb063c | |||
| bb2c8bd1a0 | |||
| 88a618647d | |||
| f4fccadb7b | |||
| fb4c2404f7 | |||
| 86940aa666 | |||
| 1e368a1324 | |||
| 559b03336e | |||
| 0a7521af40 | |||
| 0b51a1a491 | |||
| f54eee595c |
@@ -1,2 +0,0 @@
|
||||
# Project exclude paths
|
||||
/out/
|
||||
@@ -0,0 +1,32 @@
|
||||
using System;
|
||||
|
||||
public class Laba2
|
||||
{
|
||||
|
||||
|
||||
public static void Main(string[] args)
|
||||
{
|
||||
const int a = 2;
|
||||
int[][] b = new[]
|
||||
{
|
||||
new int[] { 1, 2, 8 },
|
||||
new int[] { 3, 4, 5 },
|
||||
new int[] { 6, 7, 9 }
|
||||
};
|
||||
calculation(b, a);
|
||||
}
|
||||
|
||||
private static int[][] calculation(int[][] b, int a)
|
||||
{
|
||||
int[][]c = new int[b.Length][b[0].Length]; //недопустимий специфікатор рангу: вимагається "," або "]";
|
||||
for (int i = 0; i < b.Length; i++)
|
||||
{
|
||||
c[i] = new int[b[i].Length];
|
||||
for (int j = 0; j < b[i].Length; j++)
|
||||
{
|
||||
c[i][j] = b[i][j] * a;
|
||||
}
|
||||
}
|
||||
return c;
|
||||
}
|
||||
}
|
||||
@@ -1,11 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<module type="JAVA_MODULE" version="4">
|
||||
<component name="NewModuleRootManager" inherit-compiler-output="true">
|
||||
<exclude-output />
|
||||
<content url="file://$MODULE_DIR$">
|
||||
<sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
|
||||
</content>
|
||||
<orderEntry type="inheritedJdk" />
|
||||
<orderEntry type="sourceFolder" forTests="false" />
|
||||
</component>
|
||||
</module>
|
||||
+3
-79
@@ -1,36 +1,13 @@
|
||||
public class Lab2 {
|
||||
public static void main(String[] args) {
|
||||
final int A = 2;
|
||||
final int[][] MATRIX_B = {
|
||||
{1, 202, 1, 1, 202, 3, 1, 202, 3,},
|
||||
{1, 202, 1, 1, 202, 3, 1, 202, 3,},
|
||||
{1, 1, 3, 1, 202, 3, 1, 202, 3,},
|
||||
// {4, 5, 6,},
|
||||
};
|
||||
|
||||
int[][] MATRIX_C = multiplication(A, MATRIX_B);
|
||||
|
||||
print(MATRIX_C);
|
||||
|
||||
System.out.println("Sum of smallest elements in every column: " + sumOfSmallestElementsInEveryColumn(MATRIX_C));
|
||||
|
||||
/*int[] array = {1, 2, 3};
|
||||
int[] array2 = new int[3];
|
||||
Object[] array3 = new String[3];
|
||||
System.out.println(array3[0]); //nothing, trash from the memory, null || null
|
||||
System.out.println(array2[0]); //nothing, trash from the memory, null || 0
|
||||
System.out.println(array[0]); // || 1
|
||||
|
||||
int[][] matrix2 = new int[2][3];
|
||||
matrix2[0] = new int[2];
|
||||
matrix2[1] = new int[1];
|
||||
for (int i = 0; i < array.length; i++) {
|
||||
int[] array = {1, 2, 3};
|
||||
/*for (int i = 0; i < array.length; i++) {
|
||||
if (i % 2 == 0) {
|
||||
System.out.println("!" + array[i]);
|
||||
} else {
|
||||
System.out.println("?" + array[i]);
|
||||
}
|
||||
}
|
||||
}*/
|
||||
|
||||
for (int i = 0; i < array.length; i+=2) {
|
||||
System.out.println("!" + array[i]);
|
||||
@@ -45,58 +22,5 @@ public class Lab2 {
|
||||
{1, 2},
|
||||
{3}
|
||||
};
|
||||
|
||||
// C=a×B, a - const
|
||||
|
||||
|
||||
// final int[][] MATRIX_C = int;
|
||||
|
||||
|
||||
MATRIX_B[0][0] = 2;
|
||||
MATRIX_B[0] = new int[]{1, 2};
|
||||
System.out.println(MATRIX_B[0][0]);
|
||||
MATRIX_B = new int[][]{
|
||||
{1, 2},
|
||||
{3}
|
||||
};*/
|
||||
}
|
||||
|
||||
private static int sumOfSmallestElementsInEveryColumn(final int[][] MATRIX_C) {
|
||||
// todo check different length of rows
|
||||
// todo try to change i and j
|
||||
// todo check repetition of minimal elements
|
||||
int sum = 0;
|
||||
for (int i = 0; i < MATRIX_C[0].length; i++) {
|
||||
int tmpSmallest = MATRIX_C[0][i];
|
||||
for (int j = 1; j < MATRIX_C.length; j++) {
|
||||
if (MATRIX_C[j][i] < tmpSmallest) {
|
||||
tmpSmallest = MATRIX_C[j][i];
|
||||
}
|
||||
}
|
||||
sum += tmpSmallest;
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
|
||||
private static void print(final int[][] MATRIX_C) {
|
||||
for (int i = 0; i < MATRIX_C.length; i++) {
|
||||
for (int j = 0; j < MATRIX_C[i].length; j++) {
|
||||
// System.out.print(MATRIX_C[i][j] + "\t");//printf("%4d",
|
||||
System.out.printf("%4d ", MATRIX_C[i][j]);//printf("%4d",
|
||||
}
|
||||
System.out.println();
|
||||
}
|
||||
}
|
||||
|
||||
private static int[][] multiplication(int A, final int[][] MATRIX_B) {
|
||||
final int[][] MATRIX_C = new int[MATRIX_B.length][/*MATRIX_B[0].length*/]; // todo !!!DANGER different lengths of rows
|
||||
// final int[][] MATRIX_C = MATRIX_B;
|
||||
for (int i = 0; i < MATRIX_B.length; i++) {
|
||||
MATRIX_C[i] = new int[MATRIX_B[i].length];
|
||||
for (int j = 0; j < MATRIX_B[i].length; j++) {
|
||||
MATRIX_C[i][j] = MATRIX_B[i][j] * A;
|
||||
}
|
||||
}
|
||||
return MATRIX_C;
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user