From 4712840ba2bda5163093540de012f19fd0b91216 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=D0=98=D0=B3=D0=BE=D1=80=D1=8C?= Date: Wed, 1 Apr 2026 14:52:29 +0300 Subject: [PATCH] =?UTF-8?q?=D1=83=D0=B1=D1=80=D0=B0=D0=BB=20=D0=BF=D0=BE?= =?UTF-8?q?=D0=B2=D1=82=D0=BE=D1=80=D0=B5=D0=BD=D0=B8=D0=B5=20=D1=87=D0=B8?= =?UTF-8?q?=D1=81=D0=B5=D0=BB=20=D0=B8=D0=B7=20=D0=BC=D0=B0=D1=82=D1=80?= =?UTF-8?q?=D0=B8=D1=86=D1=8B?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- task1(2).py | 25 ++++++++++++++----------- 1 file changed, 14 insertions(+), 11 deletions(-) diff --git a/task1(2).py b/task1(2).py index 494f902..b5944cb 100644 --- a/task1(2).py +++ b/task1(2).py @@ -20,7 +20,7 @@ def search_binary_diagonal(matrix, K): mid = (left + right) // 2 if matrix[mid][mid] == K: - return True, 1 + return True, steps elif matrix[mid][mid] < K: diag_indx = mid left = mid + 1 @@ -63,18 +63,16 @@ def generate_matrix(N, M): Генерирует матрицу N x M со случайными числами """ matrix = [[0] * M for g in range(N)] + current = 1 - - matrix[0][0] = r.randint(1, 10) - for j in range(1, M): - matrix[0][j] = matrix[0][j-1] + r.randint(1, 8) - - for i in range(1, N): + for i in range(N): for j in range(M): - min_val = matrix[i-1][j] - if j > 0: - min_val = max(min_val, matrix[i][j-1]) - matrix[i][j] = min_val + r.randint(1, 8) + if i == 0 and j == 0: + matrix[i][j] = current + current += r.randint(1, 8) + else: + matrix[i][j] = current + current += r.randint(1, 9) return matrix @@ -93,6 +91,11 @@ def main(): print("\nСгенерированная матрица:") print_matrix(matrix) + all_numbers = [] + for row in matrix: + all_numbers.extend(row) + + unique_numbers = set(all_numbers) K = int(input("\nВведите число для поиска: ")) found, steps = search_binary_diagonal(matrix, K)