-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path#11.cpp
55 lines (38 loc) · 1.29 KB
/
#11.cpp
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
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll A[20][20];
int main() {
ll maximum=0,product;
for(int i=0;i<20;i++){
for(int j=0;j<20;j++){
cin>>A[i][j];
}
}
for(int i=0;i<20;i++){
for(int x=0;x<20;x++){
product = 1;
for(int j=x;j<x+4 && j<20;j++){ // right
product = 1ll*product*A[i][j];
}
maximum = maximum>product?maximum:product;
product = 1;
for(int j=i;j<i+4 && j<20;j++){ // down
product = 1ll*product*A[j][x];
}
maximum = maximum>product?maximum:product;
product = 1;
for(int j=i,k=x;k>x-4 && j<i+4 && j<20 && k>=0;j++,k--){ // digonally left
product = 1ll*product*A[j][k];
}
maximum = maximum>product?maximum:product;
product = 1;
for(int j=i,k=x;k<x+4 && j<i+4 && j<20 && k<20;j++,k++){ // digonally down
product = 1ll*product*A[j][k];
}
maximum = maximum>product?maximum:product;
}
}
cout<<maximum<<"\n";
return 0;
}