题解 | #杨辉三角的变形#

记录下代码

arr = [[1]]

row = int(input())

# 初始化数组

for i in range(row - 1):

    i += 1

    arr2 = []

    for j in range(i * 2 + 1):

        arr2.append(0)

    arr.append(arr2)

for i in range(row - 1):

    i += 1

    for j in range(i * 2 + 1):

        if j > 1:

            arr[i][j] += arr[i - 1][j - 2]

        if 0 < j < len(arr[i]) - 1:

            arr[i][j] += arr[i - 1][j - 1]

        if -1 < j < len(arr[i]) - 2:

            arr[i][j] += arr[i - 1][j]

for i in range((row - 1) * 2 + 1):

    if arr[row - 1][i] % 2 == 0:

        print(i + 1)

        break

    if i == (row - 1) * 2:

        print(-1)