Created Solution.php

Solution.php

@@ -0,0 +1,27 @@
+<?php
+function solve() {
+    $T = intval(readline());
+    for ($t = 0; $t < $T; $t++) {
+        $n = intval(readline());
+        $a = [];
+        for ($i = 0; $i < 2 * $n; $i++) {
+            $a[] = array_map('intval', explode(' ', readline()));
+        }
+        $ret = 0;
+        for ($i = 0; $i < $n; $i++) {
+            for ($j = 0; $j < $n; $j++) {
+                $max = max(
+                    $a[$i][$j],
+                    $a[2 * $n - 1 - $i][$j],
+                    $a[2 * $n - 1 - $i][2 * $n - 1 - $j],
+                    $a[$i][2 * $n - 1 - $j]
+                );
+                $ret += $max;
+            }
+        }
+        echo $ret . PHP_EOL;
+    }
+}
+
+solve();
+?>

Solution.rb

@@ -0,0 +1,22 @@
+def solve
+  t = gets.to_i
+  t.times do
+    n = gets.to_i
+    a = Array.new(2 * n) { gets.split.map(&:to_i) }
+    ret = 0
+    n.times do |i|
+      n.times do |j|
+        max_val = [
+          a[i][j],
+          a[2 * n - 1 - i][j],
+          a[2 * n - 1 - i][2 * n - 1 - j],
+          a[i][2 * n - 1 - j]
+        ].max
+        ret += max_val
+      end
+    end
+    puts ret
+  end
+end
+
+solve