C++博客-yajunhttp://www.cppblog.com/yajun/zh-cnThu, 23 Apr 2026 10:14:13 GMTThu, 23 Apr 2026 10:14:13 GMT60Computerhttp://www.cppblog.com/yajun/archive/2008/06/08/52560.htmlwcily123wcily123Sun, 08 Jun 2008 09:25:00 GMThttp://www.cppblog.com/yajun/archive/2008/06/08/52560.htmlhttp://www.cppblog.com/yajun/comments/52560.htmlhttp://www.cppblog.com/yajun/archive/2008/06/08/52560.html#Feedback0http://www.cppblog.com/yajun/comments/commentRss/52560.htmlhttp://www.cppblog.com/yajun/services/trackbacks/52560.html阅读全文

wcily123 2008-06-08 17:25 发表评论
]]>今年暑假不AChttp://www.cppblog.com/yajun/archive/2008/06/08/52559.htmlwcily123wcily123Sun, 08 Jun 2008 09:20:00 GMThttp://www.cppblog.com/yajun/archive/2008/06/08/52559.htmlhttp://www.cppblog.com/yajun/comments/52559.htmlhttp://www.cppblog.com/yajun/archive/2008/06/08/52559.html#Feedback0http://www.cppblog.com/yajun/comments/commentRss/52559.htmlhttp://www.cppblog.com/yajun/services/trackbacks/52559.html 1#include <iostream>
 2
 3using namespace std;
 4
 5int main()
 6{
 7    //freopen("d:/test.in","r",stdin);
 8    int n,ts[101],te[101],i,j,k,t;
 9    while(cin>>n&&n)
10    {
11    for(i=0; i<n; ++i)
12    {
13        cin>>ts[i];
14        cin>>te[i];
15    }
16    for(i=1; i<n; ++i)
17        for(j=0; j<n-i; ++j)
18            if(te[j]>te[j+1])
19            {
20                t=te[j];te[j]=te[j+1];te[j+1]=t;
21                t=ts[j];ts[j]=ts[j+1];ts[j+1]=t;
22            }
23    t=1;k=te[0];
24    for(i=0; i<n-1; ++i)
25       for(j=i+1; j<n; ++j)
26       {
27           if(k<=ts[j])
28           {
29               i=j-1;
30               k=te[j];
31               t++;
32               break;
33           }
34       }
35       cout<<t<<endl;
36    }
37}

wcily123 2008-06-08 17:20 发表评论
]]>