#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
int begin;
int end;
};
int num=0;
int temp = 0;
int n;
node s[110];
bool rule (const node& x, const node& y)
{
return x.end < y.end;
}
int main()
{
while (scanf("%d", &n) && n){
for (int i = 1; i <= n; i++)
{
cin >> s[i].begin >> s[i].end;
}
sort(s+1,s+n,rule);
for (int i = 1; i <= n;i++)
{
if (temp <= s[i].begin)
{
temp = s[i].end;
num++;
}
}
}
cout << num;
return 0;
}
ps:这道题我们挑选结束时间最早的电影开始看,具体先按结束时间给它们排序(sort或者multiset),这道题需要搞清楚输入数据不是一组,是很多组!!!!!!!!注意输入0才算输入结束