ZOJ-2680

水题一道，不多说啥了，今天连续两次one A了，状态不错，哈哈自恋下

#include<stdio.h>
#include<math.h>
#include<stdlib.h>

double angle(char *time)
{
    int hh = (time[0] - '0') * 10 + time[1] - '0';
    int mm = (time[3] - '0') * 10 + time[4] - '0';
    double hangle = (hh % 12) * 30 + mm * 0.5;
    double mangle = mm * 6;
    double diff = fabs(hangle - mangle);
    return diff < 360 - diff ? diff : 360 - diff;
}

int cmp2680(const void *t1, const void *t2)
{
    char *time1 = (char*) t1;
    char *time2 = (char*) t2;
    double a1 = angle((char*) time1);
    double a2 = angle((char*) time2);
    if (a1 == a2)
    {
        int hh1 = (time1[0] - '0') * 10 + time1[1] - '0';
        int mm1 = (time1[3] - '0') * 10 + time1[4] - '0';
        int hh2 = (time2[0] - '0') * 10 + time2[1] - '0';
        int mm2 = (time2[3] - '0') * 10 + time2[4] - '0';
        if (hh1 != hh2)
            return hh1 - hh2;
        else
            return mm1 - mm2;
    }
    else if (a1 > a2)
        return 1;
    else
        return -1;

}

int main()
{
    int n;
    char time[5][6];
    scanf("%d", &n);
    while (n--)
    {
        int i;
        for (i = 0; i < 5; i++)
            scanf("%s", time[i]);
        qsort(time, 5, sizeof(time[0]), cmp2680);
        puts(time[2]);
    }
    return 0;
}