#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int a[10001] = {0},i,j,L,m,x,y;
while(cin >> L >> m)
{
while(m--){
cin >> x >> y;
for(i = x; i <= y; i++) a[i] = 1;
}
j = 0;
for(i = 0; i <= L; i++)
if(a[i] != 1) j++;
cout << j << endl;
}
return 0;
}
区间合并
//采用区间合并的方式
#include <iostream>
#include <algorithm>
#define x first
#define y second
using namespace std;
typedef pair<int, int>PII;
const int N = 110;
int n, m;
int main()
{
while(cin >> n >> m){
PII p[N];
int sum = 0;
for(int i = 0; i < m; i++)
cin >> p[i].x >> p[i].y;
sort(p,p+m);
//区间合并
int L = p[0].x, R = p[0].y;
for(int i = 1; i < m; i++)
{
if(p[i].x <= R) R=max(p[i].y,R);
else{
sum += R - L + 1;
L = p[i].x, R = p[i].y;
}
}
sum += R-L+1;
cout << n-sum+1 << endl;
}
return 0;
}