HDU1209：Clock

参考：https://blog.csdn.net/libin56842/article/details/8990530

https://blog.csdn.net/u011479875/article/details/47194363

https://blog.csdn.net/u012712087/article/details/48008745

https://www.cnblogs.com/AndyJee/archive/2014/07/02/3821067.html

 #include <iostream>
 #include <cmath>
 #include <algorithm>
 #include <cstdio>
 #include <cstring>
 #include <cctype>
 #include <sstream>
 using namespace std;
 int t;
 int nu[];
 struct node
 {
     int h,m;
     float v;
 }no[];
 float findv(int x,int y)//求夹角
 {
     x=x%;//要先取余~
     y=y;//分针不用取余~
     float vx=x*+y*0.5,vy=y*,vxy=fabs(vx-vy);//vx为时针角，vy为分针角，把30等数字写成30.0形式能缩短时间！
     if (vxy<=)
     {
         return vxy;
     }
     else
     {
         return -vxy;
     }
 }
 bool cmp(struct node x,struct node y)
 {
     if (x.v<y.v)//不是<=~
     {
         return true;
     }
     else if(x.v==y.v&&x.h<y.h)
     {
         return true;
     }
     else
     {
         return false;
     }
 }
 int main()
 {
 //    freopen("text.txt","r",stdin);
     while (scanf("%d",&t)!=EOF)
     {
         string s;
         getchar();//用getline前要清除回车~
         for (int i=;i<t;i++)
         {
             getline(cin,s,'\n');//不能用cin，cin遇空格会结束~
             for (int j=;j<s.length();j++)
             {
                 if (!isalnum(s[j]))
                 {
                     s[j]=' ';
                 }
             }
             stringstream ss(s);
             int c=;
             memset(nu,,sizeof(nu));//数组等容器设为全局变量方便写测试函数！
             while (ss>>nu[c])
             {
                 c++;
             }
             int j=;
             memset(no,,sizeof(no));
             for (int i=;i<c;i+=)
             {
                 int hh=no[j].h=nu[i-];
                 int mm=no[j].m=nu[i];
                 no[j].v=findv(hh,mm);
                 j++;
             }
             sort(no,no+,cmp);//范围是no+5不是no+c~
 //            for (int k=0;k<5;k++)//提交前要记得注释掉测试语句~
 //            {
 //                printf("%d %d %f\n",no[k].h,no[k].m,no[k].v);
 //            }
             printf("%02d:%02d\n",no[].h,no[].m);
         }
     }
 
     return ;
 }