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
149
150
151
152
153
154
| #include <iostream>
#include <ctime>
#include <cstdlib>
#include <iomanip>
#define FORi(v) for(int i = 0; i < v; ++i)
#define FORj(v) for(int j = 0; j < v; ++j)
#include <windows.h>
struct smystart
{ smystart()
{ setlocale(0, "");
system("mode 80,50");
srand(time(NULL));
scroll();
}
void scroll()
{ CONSOLE_SCREEN_BUFFER_INFO csbi;
HANDLE hConsole=GetStdHandle(STD_OUTPUT_HANDLE);
GetConsoleScreenBufferInfo(hConsole, &csbi);
csbi.dwSize.Y = 1000;//10000 строк
SetConsoleScreenBufferSize(hConsole, csbi.dwSize);
return;
}
}sys;
void arr_delete(int**& a, int r)
{ FORi(r) delete[] a[i];
delete[] a;
}
int** arr_create(int** a, int r, int c)
{ if(a) arr_delete(a, r);
a = new int*[r];
FORi(r) a[i] = new int [c];
return a;
}
///----------------------------|
/// На экран. |
///----------------------------:
void show(int** a, int row, int col)
{ std::cout << "Массив---------------------------------------------------:\n";
for (int r = 0; r < row; ++r)
{ for(int c = 0; c < col; ++c)
{ std::cout << std::setw(4)<< a[r][c] << " ";
}
std::cout << "\n";
}
}
int rrand(int range_min, int range_max)
{ return rand() % (range_max - range_min + 1) + range_min;
}
void rnd_matrix(int** a, int row, int col)
{ int n = 0;
for (int r = 0; r < row; ++r)
for(int c = 0; c < col; ++c)
a[r][c] = rrand(-50, 50);
}
///--------------------------------------------|
/// Провека двух строк на линейную зависимость.|
///--------------------------------------------:
bool is_linear_relationship(int* a, int* b, int n)
{ int sa = 0, sb = 0;
FORi(n)
{ sa += a[i];
sb += b[i];
}
if(sa == 0 || sb == 0) return false;
FORi(n)
{ if(a[i] >= b[i])
{ if( (b[i] != 0) && ((a[i]%b[i]) != 0) )
return false;
}
else
{ if( (a[i] != 0) && ((b[i]%a[i]) != 0) )
return false;
}
}
return true;
}
///----------------------------------------------------------------------------|
/// Старт.
///----------------------------------------------------------------------------:
int main()
{
int** arr = NULL;
int row = 222;
int col = 2;
while(true)
{
//std::cout << "row = "; std::cin >> row;
//std::cout << "col = "; std::cin >> col;
std::cout << std::endl;
arr = arr_create(arr, row, col); /// Создаём матрицу.
rnd_matrix(arr, row, col); /// Заполняем рандомно.
show (arr, row, col); /// На экран.
///------------------------------|
/// Суммирием столбцы |
///------------------------------:
int* sum = new int[col];
FORi(col) sum[i] = 0;
FORi(col)
{ FORj(row)
{ sum[i] += arr[j][i];
}
}
///------------------------------|
/// Ищем максимальное среди сумм.|
///------------------------------:
int max = INT_MIN;
FORi(col)
{ if(sum[i] > max) max = sum[i];
}
std::cout << "\nМаксимальная сумма столбца: " << max << "\n\n";
///------------------------------------------------------------------------|
/// Поиск линейнно зависимых строк. |
///------------------------------------------------------------------------:
int b = 0;
std::cout << "Поиск линейнно зависимых строк---------------------------:\n";
for (int i = 0 ; i < row-1; i++)
{ for(int j = i+1; j < row ; j++)
{ if(is_linear_relationship(arr[i], arr[j], col))
{ std::cout << std::setw(4) << i << ","
<< std::setw(4) << j << "\n"; b++;
}
}
}
if(b) std::cout << "Кол-во найденных пар: " << b << "\n";
else std::cout << "Ничаво не найдено!\n";
std::cin.clear();//----------------------------------------------------|
std::cin.sync();//
std::cin.get();//
system("cls");//
delete[] sum;//
}
std::cout << "\nПРОГРАММА ЗАВЕРШЕНА!\n\n";
arr_delete(arr, row);
std::cin.get();
return 0;
} |
(
Сообщение от Tolstyha77
