n = int(input(''))
arr = []
for i in range(n):
arr.append([])
for j in range(i+1):
if j == 0 or i == j:
arr[i].append(1)
else:
arr[i].append(arr[i-1][j-1] + arr[i-1][j])
print(" ".join(str(a) for a in arr[i]))
2.节点选择
def dfs(node,pre):
global value,table
for i in table.get(node):
if i !=pre:
dfs(i,node)
value[node][0]+=max(value[i][0],value[i][1])
value[node][1]+=value[i][0]
def main():
global value, table
n = int(input())
value = list(map(int, input().split()))
value = list(map(lambda x:[0,x],value))
value.insert(0,0)
table = {}
for i in range(n):
table.update({i + 1: []})
for i in range(n - 1):
father, child = list(map(int, input().split()))
table.get(father).append(child)
table.get(child).append(father)
print(table)
dfs(1,0)
print(max(value[1][0],value[1][1]))
if __name__=='__main__':
main()
3.耐摔指数
import sys
if __name__ == '__main__':
phone = 3
height = int(input())
dp = [[0 for h in range(height)] for k in range(phone)]
for h in range(height):
dp[0][h] = h+1
for k in range(phone):
dp[k][0] = 1
for h in range(1, height):
for k in range(1, phone):
minNum = sys.maxsize
for t in range(1, h+1):
minNum = min(minNum, 1 + max(dp[k-1][t-1], dp[k][h-t-1]))
dp[k][h] = minNum
print(dp[phone-1][height-1])
4.K好数
K,L=list(map(int,input().split()))
num=[[0 for i in range(L)] for j in range(K)]
for i in range(K):
num[i][0]=1
for j in range(L-1):
for i in range(K):
tmp=0
for k in range(K):
if k==i or abs(k-i)!=1:
tmp+=num[k][j]
num[i][j+1]=tmp
ans=0
for i in range(1,K):
ans+=num[i][L-1]
print(ans%1000000007)