Ruudukko

s = ""

n = int(input())

grid = [input() for i in range(n)]

paths = [[0 for i in range(n)] for j in range(n)]

paths[0][0] = grid[0][0]

for i in range(1, n):
    paths[0][i] = paths[0][i-1] + grid[0][i]

for i in range(1, n):
    paths[i][0] = paths[i - 1][0] + grid[i][0]

for i in range(1, n):
    for j in range(1, n):
        paths[i][j] = min(paths[i-1][j], paths[i][j-1]) + grid[i][j]

    paths[i-1] = None
print(paths[n-1][n-1])

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED