hdu2115 I Love This Game

#include <iostream>
using namespace std;

struct node
{
       int mm;
       int ss;
       char name[30];
};

node data[21];

int comp(const void *a,const void *b)
{
       struct node *p = (node *)a;
       struct node *q = (node *)b;
       if(p->mm != q->mm)
       {
              return p->mm - q->mm;
       }
       else
       {
              if(p->ss != q->ss)
              {
                     return p->ss - q->ss;
              }
              else
              {
                     return strcmp(p->name,q->name);
              }
       }
}

int main()
{
       int n;
       int flag = 0;
       
       //freopen("2115.txt","r",stdin);
       while(cin >> n,n)
       {
              flag++;
              for(int i = 0; i < n; ++i)
              {
                     scanf("%s %d:%d",data[i].name,&data[i].mm,&data[i].ss);
              }
              qsort(data,n,sizeof(data[0]),comp);
              if(flag != 1)
              {
                     cout << endl;
                     cout << "Case #" << flag << endl;
              }
              else
              {
                     cout << "Case #" << flag << endl;
              }
              int t = 0;
              int m;
              int s;
              int f = 0;
              for(int j = 0; j < n; ++j)
              {
                     if(t == 0)
                     {
                            cout << data[j].name << " " << j + 1 << endl;
                            m = data[j].mm;
                            s = data[j].ss;
                            f = j + 1;
                     }
                     else
                     {
                            if(m == data[j].mm && s == data[j].ss)
                            {
                                   cout << data[j].name << " " << f << endl; 
                            }
                            else
                            {
                                   m = data[j].mm;
                                   s = data[j].ss;
                                   f = j + 1;
                                   cout << data[j].name << " " << j + 1 << endl;
                            }
                     }    
                     t++;
              }
       }
    return 0;
}