题解 | 校门外的树
校门外的树
https://www.nowcoder.com/practice/0e8cfc82936048769af45967f3c4ef7e
import sys
a = sys.stdin.readline().split()
L, M = int(a[0]), int(a[1])
hash = dict.fromkeys(range(L + 1), 1)
for _ in range(M):
tree = sys.stdin.readline().split()
s, e = int(tree[0]), int(tree[1])
for i in range(s,e+1):
if hash[i] == 1:
hash[i] = 0
sum=sum(hash.values())
print(sum)
投递完美世界等公司6个岗位
