We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 11: 2D Arrays
  5. Discussions

Day 11: 2D Arrays

Sort by

recency

|

1939 Discussions

|

  • garethguo1996
     + 0 comments

    Python3 Solution

    import math import os import random import re import sys

    if name == 'main':

    arr = []

for _ in range(6):
    arr.append(list(map(int, input().rstrip().split())))
# print(arr)

max_hg =  curr_hg = float('-inf')

for i in range(4):
    for j in range(4):
        first_row = arr[i][j] + arr[i][j+1] + arr[i][j+2]
        second_row = arr[i+1][j+1]
        third_row = arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2]
        curr_hg = first_row + second_row + third_row

        if curr_hg > max_hg:
            max_hg = curr_hg

print(max_hg)

  • akulbachandra67
     + 1 comment
    def total(i,j,m):
a = m[i-1][j-1] + m[i-1][j] + m[i-1][j+1] 
b = m[i][j]
c = m[i+1][j-1] + m[i+1][j] + m[i+1][j+1] 
return a + b + c 


if __name__ == '__main__':
l = []
for _ in range(6):
row = list(map(int,input().split()))
l.append(row)
s = [] 
for i in range(1,5):
for j in range(1,5):
s.append(total(i,j,l)) 

print(max(s))

  • shobithap088
     + 0 comments

    import java.util.Scanner;

    public class HourglassSum { public static void main(String[] args) { Scanner sc = new Scanner(System.in);

        int[][] arr = new int[6][6];

    // Input 6x6 array
    for (int i = 0; i < 6; i++) {
        for (int j = 0; j < 6; j++) {
            arr[i][j] = sc.nextInt();
        }
    }

    int maxSum = Integer.MIN_VALUE;

    // Traverse possible hourglass centers (i from 1 to 4, j from 1 to 4)
    for (int i = 1; i < 5; i++) {
        for (int j = 1; j < 5; j++) {
            int sum = 
                arr[i - 1][j - 1] + arr[i - 1][j] + arr[i - 1][j + 1] + // top
                arr[i][j] +                                             // center
                arr[i + 1][j - 1] + arr[i + 1][j] + arr[i + 1][j + 1];  // bottom

            if (sum > maxSum) {
                maxSum = sum;
            }
        }
    }

    System.out.println(maxSum);
    sc.close();
}

    }

  • yovher
     + 0 comments

    python 3

    !/bin/python3

    import math import os import random import re import sys

    if name == 'main':

    arr = []

for _ in range(6):
    arr.append(list(map(int, input().rstrip().split())))
results=[]
for i in range(0,4):
    for j in range(0,4):
        r=(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])     
        results.append(r)       
print(max(results))

  • nhattan214
     + 0 comments
    #!/bin/python3

import math
import os
import random
import re
import sys


if __name__ == '__main__':
    a = []
    for _ in range(6):
        a.append(list(map(int, input().rstrip().split())))
    row=len(a)
    R=[]
    for i in range(row-2):
        for j in range(row-2):
            R.append(a[i][j]+a[i][j+1]+a[i][j+2]+a[i+1][j+1]+a[i+2][j]+a[i+2][j+1]+a[i+2][j+2])
    print(max(R))