l,m=map(int,input().split())
s=l+1
d=[1 for i in range(l+1)]
for i in range(m):
h,j=map(int,input().split())
for j in range(h,j+1):
d[j]=0
ans=d.count(1)
print(ans)
1107:校门外的树 一本通 Python
最新推荐文章于 2024-09-28 22:05:59 发布
l,m=map(int,input().split())
s=l+1
d=[1 for i in range(l+1)]
for i in range(m):
h,j=map(int,input().split())
for j in range(h,j+1):
d[j]=0
ans=d.count(1)
print(ans)