View Code of Problem 4044

#include <iostream>
#include <algorithm>
using namespace std;
typedef struct jiangzuo{
	int begin;
	int end;
}jz;
bool cmp(jz x,jz y){
	return x.end<y.end;
}
int main(){
	int n;
	while(cin>>n){
		if(n==0) break; 
		jz j[n];
		for(int i=0;i<n;i++){
			cin>>j[i].begin>>j[i].end;
		}
		sort(j+0,j+n,cmp);
		int e = j[0].end;
		int num = 1;
		for(int i=1;i<n;i++){
			if(j[i].begin>=e){
				e = j[i].end;
				num++;
			}
		}
		cout<<num<<endl;
	}
}