-
- #include<iostream>
- #include<algorithm>
- #include<string.h>
- #include<algorithm>
- #include<iostream>
- using namespace std;
- struct program {
- int s;
- int e;
- };
-
- int cmp(program a, program b) {
- return a.e < b.e;
- }
-
- int main() {
- int n; program time[110];
- while (~scanf("%d", &n) && n) {
- memset(time, 0, sizeof(time));
- int i;
- for (i = 0; i < n; i++) {
- scanf("%d%d", &time[i].s, &time[i].e);
- }
- sort(time, time + n, cmp);
- int temp = time[0].e, count = 1;
- for (i = 1; i < n; i++) {
- if (time[i].s >= temp) {
- count++;
- temp = time[i].e;
- }
- }
- printf("%d\n", count);
- }
- return 0;
- }