1209 hdu

#include<iostream>//2302409 2010-04-06 18:21:56 Accepted 1209 15MS 256K 1412 B C++ 悔惜晟
#include<cstdio>//非常纠结的题目
#include<algorithm>
#include<cmath>
using namespace std;
struct stu
{
 int a;
 int b;
 double num;
}df[6];
int cmp(stu aa, stu bb)
{
 //if(aa.num == bb.num)
  //return aa.a < bb.a;
 //else if(aa.a == bb.a)
  //return aa.b < bb.b;
 //else
 if(aa.num != bb.num)
  return aa.num < bb.num;
 else if(aa.a == bb.a)
  return aa.b < bb.b;
 else
  return aa.a < bb.a;
}
int main()
{
 int  t, i, h, s;
 char g;
 double p, q, ww;
 scanf("%d", &t);
 while(t--)
 {
  memset(df, 0, sizeof(df));
  for(i = 0; i < 5; i++)
  {
   scanf("%d%c%d", &df[i].a, &g, &df[i].b);
   h = df[i].a;
   s = df[i].b;
   if(h >= 12)
    h -= 12;
   p = 30*h + s/2.0;
   q = 6.0 * s;
   ww =fabs(p - q);
   if(ww > 180)
    ww = 360 - ww;
   df[i].num = ww;
   //getchar();
   //if(df[i].a >= 12) //df[i].a -= 12;
   //{
    //df[i].num = fabs(30*(1.0*df[i].b/60 + df[i].a - 12) - df[i].b*6.0);
   //}
   //else
    //df[i].num = fabs(30*(1.0*df[i].b/60 + df[i].a) - df[i].b*6.0);
   //if(df[i].num >= 270)
    //df[i].num -= 180;
    //360 -= df[i].num;
    //df[i].num = 360 - df[i].num;
   //else
    //if(df[i].num > 180)
    //df[i].num = 360 - df[i].num;
    //printf("%0.2lf/n", df[i].num);

  }
  sort(df, df + 5, cmp);
  //for(i = 0; i < 5; i++)
   //printf("%0.2lf/n", df[i].num);
  printf("%02d:%02d/n", df[2].a,df[2].b);

 }
}