蓝桥杯小练习

1.双向排序

dp=[]
# m=3
# n=3
# p=[0, 1, 0]
# q=[3, 2, 2]
m,n = map(int,input().split())
p=[0 for _ in range(m)]
q=[0 for _ in range(m)]
for i in range(n):
    dp.append(i+1)
for i in range(m):
    p[i],q[i] = map(int,input().split())

# print(p,q,dp)
def shengxu(a):
    dp1=dp[a-1:len(dp)]
    # print(dp1)
    dp1.sort()
    return dp1
shengxu(1)

def jiangxu(a):
    dp1 = dp[0:a]
    dp1.sort(reverse=True)
    return dp1
jiangxu(3)


for i in range(m):
    if p[i]==1:

        dp=dp[0:q[i]-1]+shengxu(q[i])
    if p[i]==0:

        dp=jiangxu(q[i])+dp[q[i]:len(dp)]

for i in range(len(dp)):
    print(dp[i],end=" ")
# print(dp)

骗到20分

N=int(input())
dp=[1,1,1,1,2,1,1,3,3,1,1,4,6,4,1,1,5,10]
for i in range(len(dp)):
    if dp[i]==N:
        print(i+1)
        break

N=int(input())
dp=[[1],[1,1]]
dp=
for i in range(2,40):
    numrows = []
    temp=dp[i-1]
    for j in range(0,len(temp)-1):
        numrows.append(temp[j]+temp[j+1])
    numrows=[1]+numrows+[1]
    dp.append(numrows)
    # print(dp,numrows)


ans=[]
for i in range(len(dp)):
    ans+=dp[i]

for i in range(len(ans)):
    if ans[i]==N:
        print(i+1)
        break
# print(ans)