201909卖菜买菜 python

#卖菜100
n=int(input())
a=list(map(int,input().split()))
b=[0]*n
b[0]=(a[0]+a[1])//2
b[n-1]=(a[n-1]+a[n-2])//2
for i in range(1,n-1):
    b[i]=(a[i-1]+a[i]+a[i+1])//3
print(b[0],end='')
for i in range(1,n):
    print('',b[i],end='')
#买菜100
n=int(input())
a=[]
for i in range(n):
    a.append(list(map(int,input().split())))
c=[]
for i in range(n):
    c.append(list(map(int,input().split())))
t=[0]*1000000
for i in range(n):
    for j in range(a[i][0],a[i][1]):
        t[j]+=1
    for j in range(c[i][0],c[i][1]):
        t[j]+=1
count=0
for i in t:
    if i==2:
        count+=1
print(count)

你可能感兴趣的:(python,算法,csp)