-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtask11.cpp
More file actions
149 lines (129 loc) · 4.11 KB
/
task11.cpp
File metadata and controls
149 lines (129 loc) · 4.11 KB
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
#include "task11.h"
#include "stringtokenizer.h"
//#include <sstream>
Task11::Task11()
{
//std::istringstream sss(strMatrex);
StringTokenizer token(strMatrex);
ResType i = 0;
ResType j = 0;
//while(!sss.eof())
while(token.hasMoreTokens())
{
//sss >> Matrex[j][i];
Matrex[j][i] = std::atoi(token.nextToken().c_str());
++i;
if(i == N)
{
i = 0;
++j;
}
if(j == M)
{
break;
}
}
// for(j = 0; j < M; ++j)
// {
// for(i = 0; i < N; ++i)
// {
// std::cout << Matrex[j][i]<< " ";
// }
// std::cout << std::endl;
// }
}
ITask::ResType Task11::Process()
{
const int MAX = 4;
ResType product;
result = 0;
for(ResType j = 0; j < M; ++j)
{
for(ResType i = 0; i < N; ++i)
{
//horizontal
product = Matrex[j][i];
if(i + MAX < N)
{
for(ResType k = i + 1; k < i + MAX; ++k)
{
product *= Matrex[j][k];
}
if(product > result)
{
result = product;
resultIndexs.clear();
for(ResType k = 0; k < MAX; ++k)
resultIndexs.push_back(std::make_tuple(j, i+k, Matrex[j][i+k]));
}
}
//vertical
product = Matrex[j][i];
if(j + MAX < M)
{
for(ResType k = j + 1; k < j + MAX; ++k)
{
product *= Matrex[k][i];
}
if(product > result)
{
result = product;
resultIndexs.clear();
for(ResType k = 0; k < MAX; ++k)
resultIndexs.push_back(std::make_tuple(j+k, i, Matrex[j+k][i]));
}
}
//cross 1
product = Matrex[j][i];
if( ((j + MAX) < M) && ((i + MAX) < N))
{
for(ResType k = 1; k < MAX; ++k)
{
product *= Matrex[j+k][i+k];
}
if(product > result)
{
result = product;
resultIndexs.clear();
for(ResType k = 0; k < MAX; ++k)
resultIndexs.push_back(std::make_tuple(j+k, i+k, Matrex[j+k][i+k]));
}
}
//cross 2
product = Matrex[j][i];
if( ((j + MAX) < M) && ((i - MAX) >= 0))
{
for(ResType k = 1; k < MAX; ++k)
{
product *= Matrex[j+k][i-k];
}
if(product > result)
{
result = product;
resultIndexs.clear();
for(ResType k = 0; k < MAX; ++k)
resultIndexs.push_back(std::make_tuple(j+k, i-k, Matrex[j+k][i-k]));
}
}
}
}
for(const auto &iii : resultIndexs)
{
std::cout << "j=" << std::get<0>(iii) << " i=" << std::get<1>(iii) << " num=" << std::get<2>(iii) << std::endl;
}
return result;
}
std::string Task11::getDescriptionEng()
{
return std::string("Task 11\n") +
std::string(strMatrex) +
std::string("\nWhat is the greatest product of four adjacent numbers in the same direction\n"
"(up, down, left, right, or diagonally) in the 20x20 grid?");
}
std::string Task11::getDescriptionRus()
{
return std::string("Задача 11\n") +
std::string(strMatrex) +
std::string("\nКаково наибольшее произведение четырех подряд идущих чисел в таблице 20×20,\n"
"расположенных в любом направлении (вверх, вниз, вправо, влево или по диагонали)?");
}