Problem 50599. Number Puzzle - 098
Given the following 15-by-15 matrix of numbers, find a 2-by-2 subset matrix whose sum is the smallest. Please provide your answer in the form of [row_start row_end column_start column_end]. For example, if your answer is the higlighted region in the figure, then you will present it as [13 14 3 4].
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers24
Suggested Problems
-
Program an exclusive OR operation with logical operators
749 Solvers
-
Project Euler: Problem 10, Sum of Primes
2088 Solvers
-
Similar Triangles - find the height of the tree
464 Solvers
-
Given a square and a circle, please decide whether the square covers more area.
1708 Solvers
-
29 Solvers
More from this Author180
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!