Lab_17/matrix_worker.cpp at master · Allemeshov/Lab_17 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
#pragma once
#include <iostream>
#include <fstream>
#include <string>
#include <time.h>
#include "input_helper.h"
#include "output_helper.h"
using namespace std;

int findRowIdToDelete(int matrix[][100], int size)
{
    int negatives = 0, maxNegatives = -1, rowIdToDelete = -1;
    for (int i = 0; i < size; i++)
    {
        for (int j = 0; j < size; j++)
        {
            if (matrix[i][j] < 0)
                negatives++;
        }
        if (negatives > maxNegatives)
        {
            maxNegatives = negatives;
            rowIdToDelete = i;
        }
        negatives = 0;
    }
    return rowIdToDelete;
}
int deleteRowOnId(int matrix[][100], int size, int rowIdToDelete)
{
    if (rowIdToDelete != -1)
    {
        if (rowIdToDelete != size - 1)
        {
            for (int i = 0; i < size; i++)
            {
                matrix[rowIdToDelete][i] = matrix[rowIdToDelete + 1][i];
            }
        }
        size--;
    }
    return size;
}
int findRowIdToDelete(double matrix[][100], int size)
{
    int negatives = 0, maxNegatives = 0, rowIdToDelete = -1;
    for (int i = 0; i < size; i++)
    {
        for (int j = 0; j < size; j++)
        {
            if (matrix[i][j] < 0)
                negatives++;
        }
        if (negatives > maxNegatives)
        {
            maxNegatives = negatives;
            rowIdToDelete = i;
        }
        negatives = 0;
    }
    return rowIdToDelete;
}
int deleteRowOnId(double matrix[][100], int size, int rowIdToDelete)
{
    if (rowIdToDelete != -1)
    {
        if (rowIdToDelete != size - 1)
        {
            for (int i = 0; i < size; i++)
            {
                matrix[rowIdToDelete][i] = matrix[rowIdToDelete + 1][i];
            }
        }
        size--;
    }
    return size;
}

void swapDiagonals(int matrix[][100], int size)
{
    int temp;
    for (int i = 0; i < size; i++)
    {
        temp = matrix[i][i];
        matrix[i][i] = matrix[size - 1 - i][i];
        matrix[size - 1 - i][i] = temp;
    }
    outputMatrixConsole(matrix, size, size);
}
void processMatrix(int matrix[][100], int size)
{

    int rowIdToDelete = -1;

    swapDiagonals(matrix, size);

    rowIdToDelete = findRowIdToDelete(matrix, size);

    size = deleteRowOnId(matrix, size, rowIdToDelete);

    int outputType = selectOutputType();

    switch (outputType)
    {
    case 1:
        outputMatrixConsole(matrix, size + 1, size);
        break;
    case 2:
    {
        string path;
        cout << "\nPlease, enter path: ";
        // getline(cin, path);
        cin >> path;
        outputMatrixFile(matrix, size + 1, size, path);
        break;
    }
    default:
        break;
    }
}
void swapDiagonals(double matrix[][100], int size)
{
    double temp;
    for (int i = 0; i < size; i++)
    {
        temp = matrix[i][i];
        matrix[i][i] = matrix[size - 1 - i][i];
        matrix[size - 1 - i][i] = temp;
    }
    outputMatrixConsole(matrix, size, size);
}
void processMatrix(double matrix[][100], int size)
{

    int rowIdToDelete = -1;

    swapDiagonals(matrix, size);

    rowIdToDelete = findRowIdToDelete(matrix, size);

    if (rowIdToDelete != -1)
    {
        size = deleteRowOnId(matrix, size, rowIdToDelete);
        outputMatrixConsole(matrix, size + 1, size);
    }
    else
        cout << "\nImpossible to delete a row, because there's no negetive elements!\n\n\n";
}