Статья Автор: Баранов Иван

file = open('name.txt', encoding = 'utf-8') s = file.read() file.close() counter = [0] * 1200 alf = 'ячсмитьбюэждлорпавыфйцукенгшщзхъё' # используем список счетчиков. создаем список повторов каждой буквы в нижнем регистре for i in range(len(s)): if s[i-1].lower() == 'т' and s[i].lower() in alf: counter[ord(s[i].lower())] += 1 m = max(counter) for i in range(1200): if counter[i] == m: print(chr(i)) break

n, m = map(int, input().split())

grid = []

for _ in range(n):

grid.append(list(map(int, input().split())))

dp = [[0] * m for _ in range(n)]

dp[n-1][m-1] = grid[n-1][m-1]

for i in range(n-2, -1, -1):

dp[i][m-1] = dp[i+1][m-1] + grid[i][m-1]

for j in range(m-2, -1, -1):

dp[n-1][j] = dp[n-1][j+1] + grid[n-1][j]

for i in range(n-2, -1, -1):

for j in range(m-2, -1, -1):

dp[i][j] = min(dp[i+1][j], dp[i][j+1]) + grid[i][j]

print(dp[0][0])

n, m = map(int, input().split())

grid = []

for _ in range(n):

grid.append(list(map(int, input().split())))

dp = [[0] * m for _ in range(n)]

dp[n-1][0] = grid[n-1][0]

for i in range(n-2, -1, -1):

dp[i][0] = dp[i+1][0] + grid[i][0]

for j in range(1, m):

dp[n-1][j] = dp[n-1][j-1] + grid[n-1][j]

for i in range(n-2, -1, -1):

for j in range(1, m):

dp[i][j] = max(dp[i+1][j], dp[i][j-1]) + grid[i][j]

print(dp[0][m-1])

Чтобы оставить комментарий нужна авторизация

Печать