`
ssun125
  • 浏览: 41356 次
文章分类
社区版块
存档分类
最新评论

HDU 1209 ( Clock )

 
阅读更多
Problem : 1209 ( Clock )     Judge Status : Accepted
RunId : 5607237    Language : C++    Author : ssun
Code Render Status : Rendered By HDOJ C++ Code Render Version 0.01 Beta

#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;

struct Time {
    int hour;
    int minu;
    double diff;
};

bool cmp(Time &t1,Time &t2)
{    
    if(t1.diff<t2.diff)
        return true;
    if(t1.diff>t2.diff)
        return false;
    if(t1.diff==t2.diff)
    {
        return t1.hour>t2.hour? false : true;
    }
}

int main()
{
    Time times[8];
    long t,i;
    char ch;

    while(cin>>t)
    {
        while(t--)
        {        
            for(i=0; i<5; i++)
            {
                cin>>times[i].hour>>ch>>times[i].minu;
            //    cout<<times[i].hour<<":"<<times[i].minu<<endl;
                if(times[i].hour>12)
                    times[i].diff = fabs(30*(times[i].hour-12)+times[i].minu/2.0-6*times[i].minu);
                else 
                    times[i].diff = fabs(30*times[i].hour+times[i].minu/2.0-6*times[i].minu);
                if(times[i].diff>180) times[i].diff = 360 -times[i].diff;
            }
            sort(times,times+5,cmp);
            printf("%02d:%02d\n",times[2].hour,times[2].minu);
        }
    }
    return 0;
}


分享到:
评论

相关推荐

Global site tag (gtag.js) - Google Analytics