A simple question on 2D array

Author: ITES7321

Array/Hourglass in Array/Hourglass in Array.txt

@@ -0,0 +1,59 @@
+Given a 6x6 2D Array, arr:
+
+1 1 1 0 0 0
+0 1 0 0 0 0
+1 1 1 0 0 0
+0 0 0 0 0 0
+0 0 0 0 0 0
+0 0 0 0 0 0
+An hourglass in A is a subset of values with indices falling in this pattern in arr's graphical representation:
+
+a b c
+  d
+e f g
+
+There are 16 hourglasses in . An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in arr, then print the maximum hourglass sum. The array will always be 6x6.
+
+Example
+
+arr =
+-9 -9 -9  1 1 1 
+ 0 -9  0  4 3 2
+-9 -9 -9  1 2 3
+ 0  0  8  6 6 0
+ 0  0  0 -2 0 0
+ 0  0  1  2 4 0
+
+The 16 hourglass sums are:
+
+-63, -34, -9, 12, 
+-10,   0, 28, 23, 
+-27, -11, -2, 10, 
+  9,  17, 25, 18
+The highest hourglass sum is 28 from the hourglass beginning at row 1, column 2:
+
+0 4 3
+  1
+8 6 6
+Note: If you have already solved the Java domain's Java 2D Array challenge, you may wish to skip this challenge.
+
+Function Description:
+
+Complete the function hourglassSum in the editor below.
+
+hourglassSum has the following parameter(s):
+
+int arr[6][6]: an array of integers
+Returns
+
+int: the maximum hourglass sum
+
+Input Format
+Each of the 6 lines of inputs arr[i] contains 6 space-separated integers arr[i][j].
+
+Constraints
+-9 <= arr[i][j] <= 9
+0 <= i,j <= 5
+
+Output Format
+Print the largest (maximum) hourglass sum found in arr.

Array/Hourglass in Array/Solution.cpp

@@ -0,0 +1,58 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+// Complete the hourglassSum function below.
+int hourglassSum(vector<vector<int>> arr) {
+
+    int sum[16]={0};
+    int a[36];
+    static int r=0,x=0;
+
+    for(int i=0;i<6;i++){
+        for(int j=0;j<6;j++,r++){
+            a[r]=arr[i][j];
+        }
+    }
+
+
+    for(int i=0;i<22;i++,x++){
+        sum[x]=a[i]+a[i+1]+a[i+2]+a[i+7]+a[i+12]+a[i+13]+a[i+14];
+        if(i==3 || i==9 || i==15)
+            i+=2;
+        cout << sum[x] << " ";
+    }
+
+    int large = sum[0];
+
+    for(int i=1;i<16;i++){
+        if(large<sum[i])
+            large = sum[i];
+    }
+
+    return large;
+}
+
+int main()
+{
+    ofstream fout(getenv("OUTPUT_PATH"));
+
+    vector<vector<int>> arr(6);
+    for (int i = 0; i < 6; i++) {
+        arr[i].resize(6);
+
+        for (int j = 0; j < 6; j++) {
+            cin >> arr[i][j];
+        }
+
+        cin.ignore(numeric_limits<streamsize>::max(), '\n');
+    }
+
+    int result = hourglassSum(arr);
+
+    fout << result << "\n";
+
+    fout.close();
+
+    return 0;
+}