python 前三个RE
查看原帖
python 前三个RE
438789
jzr200143楼主2023/11/19 20:06
l,n = map(int,input().split())
trees = [0]*l

for _ in range(n):
    u,v = map(int,input().split())
    for j in range(u,v+1):
        trees[j]=1
print(trees.count(0)+1)
2023/11/19 20:06
加载中...