题解 | #剩下的树#
剩下的树
https://www.nowcoder.com/practice/f5787c69f5cf41499ba4706bc93700a2
while True:
try:
arr=[]
L, M = map(int, input().split())
for i in range(L+1):
arr.append(1)
for i in range(M):
a, b = map(int, input().split())
for j in range(a, b+1):
arr[j] = 0
a = arr.count(1)
print(a)
except:
break
投递阿里巴巴等公司8个岗位
