Add files via upload

Author: AdityaSeth777

11 - 2D Arrays/Solution.c

@@ -0,0 +1,32 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+int main(){
+    int arr[6][6];
+    for(int i=0;i<6;i++){
+        for(int j=0;j<6;j++){
+            scanf("%d", &arr[i][j]);
+        }
+    }
+    int max_sum = 0;
+    int temp_sum;
+    for(int i = 0; i < 4; i++) {
+        for(int j = 0; j < 4; j++) {
+            temp_sum = 0;
+            temp_sum += arr[i][j];
+            temp_sum += arr[i][j+1];
+            temp_sum += arr[i][j+2];
+            temp_sum += arr[i+1][j+1];
+            temp_sum += arr[i+2][j];
+            temp_sum += arr[i+2][j+1];
+            temp_sum += arr[i+2][j+2];
+            
+            //Aditya Seth
+            if(temp_sum > max_sum || i == 0 && j == 0)
+                max_sum = temp_sum;
+        }
+    }
+    printf("%d\n", max_sum);
+    return 0;
+}

11 - 2D Arrays/Solution.cpp

@@ -0,0 +1,28 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main() {
+    vector<vector<int>> arr(6, vector<int>(6));
+    for (int i = 0; i < 6; i++) {
+        for (int j = 0; j < 6; j++) {
+            cin >> arr[i][j];
+        }
+    }
+
+    int max = -9 * 7;
+    for (int i = 0; i < 6; i++) {
+        for (int j = 0; j < 6; j++) {
+            if (j + 2 < 6 && i + 2 < 6) {
+                int sum = 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 (sum > max) max = sum;
+            }
+        }
+    }
+
+    cout << max;
+    //Aditya Seth
+
+    return 0;
+}

11 - 2D Arrays/Solution.kt

@@ -0,0 +1,42 @@
+import java.io.*
+import java.math.*
+import java.security.*
+import java.text.*
+import java.util.*
+import java.util.concurrent.*
+import java.util.function.*
+import java.util.regex.*
+import java.util.stream.*
+import kotlin.collections.*
+import kotlin.comparisons.*
+import kotlin.io.*
+import kotlin.jvm.*
+import kotlin.jvm.functions.*
+import kotlin.jvm.internal.*
+import kotlin.ranges.*
+import kotlin.sequences.*
+import kotlin.text.*
+
+
+
+fun main(args: Array<String>) {
+        val `in` = Scanner(System.`in`)
+        val arr = Array(6) { IntArray(6) }
+        for (i in 0..5) {
+            for (j in 0..5) {
+                arr[i][j] = `in`.nextInt()
+            }
+        }
+
+        var max = -9 * 7
+        for (i in 0..5) {
+            for (j in 0..5) {
+                if (j + 2 < 6 && i + 2 < 6) {
+                    val sum = 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 (sum > max) max = sum
+                }
+            }
+        }
+
+        println(max)
+    }

11 - 2D Arrays/Solution.py

@@ -0,0 +1,17 @@
+arr = []
+
+for _ in range(6):
+    tmp = [int(x) for x in str(input()).split(" ")]
+    arr.append(tmp)
+
+maximum = -9 * 7
+
+for i in range(6):
+    for j in range(6):
+        if j + 2 < 6 and i + 2 < 6:
+            result = 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 result > maximum:
+                maximum = result
+
+print(maximum)
+#Aditya Seth

11 - 2D Arrays/Solution.rb

@@ -0,0 +1,21 @@
+arr = Array.new(6)
+max = -10000000
+
+6.times do |i|
+	arr[i] = gets.rstrip.split(' ').map(&:to_i)
+end
+
+6.times  do |i|
+	6.times  do |j|
+		if (j + 2) < 6 and (i + 2) < 6
+			sum = (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 sum  > max
+				max = sum
+			end
+		end
+	end
+end
+
+puts max