题目:http://acm.hdu.edu.cn/showproblem.php?pid=2037
#include<bits/stdc++.h>
using namespace std;
struct node
{
int s,e;
}t[109];
bool cmp(node x, node y)
{return x.e<y.e;}
int main()
{
int n,i,sum,a;
while(scanf("%d",&n)==1)
{
if(n==0) break;
for(i=1;i<=n;i++)
scanf("%d %d",&t[i].s,&t[i].e);
sort(t+1,t+n+1,cmp);
sum=1,a=1;
for(i=2;i<=n;i++)
{
if(t[i].s>=t[a].e)
sum++,a=i;
}
printf("%d\n",sum);
}
return 0;
}