while True:
try:
n = int(input())
array = [1]
for i in range(1,n):
array = [0] + array + [0]
tmp = [1]*len(array)
for j in range(1, len(array)-1):
tmp[j] = sum(array[j-1:j+2])
array = tmp
index = -1
for i in range(len(array)):
if array[i] & 1 ==0:
index = i+1
break
print(index)
except:
break
HW.杨辉三角的变形
猜你喜欢
转载自blog.csdn.net/dpengwang/article/details/93222687
今日推荐
周排行