1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
|
#include<cstdio>
#include<iostream>
#include<cstring>
using
namespace
std;
int
Hash[10000];
int
main()
{
int
L,M,i,j;
while ( scanf ( "%d%d" ,&L,&M)!=EOF){
int
a,b;
int
count=0;
for (i=0;i<=L;i++){
Hash[i]=1;
}
for (i=0;i<M;i++){
scanf ( "%d%d" ,&a,&b);
for (j=a;j<=b;j++){
Hash[j]--;
}
}
for (i=0;i<=L;i++){
if (Hash[i]==1){
count++;
}
}
printf ( "%d\n" ,count);
}
return
0;
}
|