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
| #include "stdafx.h"
#include <iostream>
#include <ctime>
using namespace std;
int ** matrix_constructor(int w, int h);
void matrix_print(int ** matrix, int w, int h);
void matrix_fill(int** matrix, int w, int h, bool random_fill);
void matrix_destructor(int **matrix, int w);
void matrix_reflect(int **matrix, int w, int h);
void do_task(int **matrix, int w, int h);
int main()
{
int n;
cout<<"Enter matrix size : "; cin>>n;
int **matrix = matrix_constructor(n, n);
matrix_fill(matrix, n, n, false);
matrix_print(matrix, n, n);
matrix_reflect(matrix, n, n);
matrix_print(matrix, n, n);
do_task(matrix, n, n);
matrix_destructor(matrix, n);
getchar();getchar();
return 0;
}
int ** matrix_constructor(int w, int h)
{
int ** matrix_new = new int *[w];
for (int i = 0; i < w; ++i)
matrix_new[i] = new int[h];
return matrix_new;
}
void matrix_print(int ** matrix, int w, int h)
{
cout<<endl<<endl;
for (int i = 0; i < w; ++i)
{
for (int j = 0; j < h; ++j)
cout << matrix[i][j] << " ";
cout << endl;
}
}
void matrix_fill(int** matrix, int w, int h, bool random_fill = true)
{
if(random_fill)
{
srand((unsigned)time(NULL));
for (int i = 0; i < w; i++)
for (int j = 0; j < h; j++)
matrix[i][j] = rand() % 30 + 10;
}
else
{
for(int i = 0; i < w; i++)
{
for(int j = 0; j < h; j++)
{
cout<<"Enter {"<<i<<":"<<j<<"}"<<" element "; cin>>matrix[i][j];
}
cout<<endl;
}
}
}
void matrix_destructor(int **matrix, int w)
{
for (int i = 0; i < w; i++)
delete[] matrix[i];
delete[] matrix;
}
void matrix_reflect(int **matrix, int w, int h)
{
int buff;
for (int i = 0; i < w; i++)
for (int j = 0; j < h; j++)
{
buff = matrix[i][j];
matrix[i][j] = matrix[j][i];
matrix[j][i] = buff;
}
}
void do_task(int **matrix, int w, int h)
{
cout<<endl<<endl;
for (int i = 0; i < w; i++)
{
int flag = 0;//если -1 - убывающя, 1 - возрастающая, 2 - не найдено
for (int j = 1; j < h; j++)
{
if(matrix[i][j] > matrix[i][j - 1] && (flag == 0 || flag == 1) && flag != -1)//возрастающая последовательность
flag = 1;
else if(matrix[i][j] < matrix[i][j - 1] && (flag == 0 || flag == -1) && flag != 1)//убывающая
flag = -1;
else
{
flag = 2;
break;
}
}
if(flag != 2)
if(flag == 1)
cout<<"In row "<<i + 1<<" '>'"<<endl;
else
cout<<"In row "<<i + 1<<" '<'"<<endl;
else
cout<<"In row "<<i + 1<<" Not found"<<endl;
}
} |
(
