-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day 11: 2D Arrays
36 lines (29 loc) · 954 Bytes
/
Day 11: 2D Arrays
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
#include <bits/stdc++.h>
using namespace std;
int main()
{
int arr[6][6]; //int sum [16];int sum1 [16];
for (int i = 0; i < 6; i++) {
for (int j = 0; j < 6; j++) {
arr[i][j]=0;
cin >> arr[i][j];
}
cin.ignore(numeric_limits<streamsize>::max(), '\n');
}
int sum = -10000;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
// [00] [01] [02]
// [11]
// [20] [21] [22]
int currentSum = arr[i][j] + arr[i][j+1] + arr[i][j+2]
+ arr[i+1][j+1]
+ arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2];
if (currentSum > sum) {
sum = currentSum;
}
}
}
cout<<sum;
return 0;
}