From 27fad4fcd1be03bf288d6e96769ed07c23e4c6e3 Mon Sep 17 00:00:00 2001 From: zagrichanskiy Date: Sat, 8 Feb 2014 10:45:36 +0200 Subject: [PATCH 1/2] Update 2.cpp --- 2.cpp | 13 +++++++++++++ 1 file changed, 13 insertions(+) diff --git a/2.cpp b/2.cpp index 9eed732..8d2b96c 100644 --- a/2.cpp +++ b/2.cpp @@ -10,12 +10,25 @@ typedef int Matrix[c_kM][c_kM]; int min_from_top_sector(Matrix& m) { + int l = 0, r = c_kM - 1; + int min = m[0][0]; + + int j = 0; + while (l <= r) { + for (int i = l; i < r; i++) + if (m[i][j] < min) min = m[i][j]; + l++; r--; + j++; + } + return min; } int _tmain(int argc, _TCHAR* argv[]) { Matrix matrix; + + // matrix initialization std::cout << min_from_top_sector(matrix) << std::endl; From f98ab29c4b4b00d4c8b85b159b8032ebf731625d Mon Sep 17 00:00:00 2001 From: zagrichanskiy Date: Sat, 8 Feb 2014 17:52:00 +0200 Subject: [PATCH 2/2] Update 2.cpp --- 2.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/2.cpp b/2.cpp index 8d2b96c..5eca909 100644 --- a/2.cpp +++ b/2.cpp @@ -15,7 +15,7 @@ int min_from_top_sector(Matrix& m) int j = 0; while (l <= r) { - for (int i = l; i < r; i++) + for (int i = l; i <= r; i++) if (m[i][j] < min) min = m[i][j]; l++; r--; j++;