Clock

最新推荐文章于 2020-11-12 23:46:13 发布

我不是石书信

最新推荐文章于 2020-11-12 23:46:13 发布

阅读量95

点赞数

分类专栏： C程序

本文链接：https://blog.csdn.net/qq_42709126/article/details/81514282

版权

C程序专栏收录该内容

60 篇文章 0 订阅

订阅专栏

Clock

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6518 Accepted Submission(s): 2055

Problem Description

There is an analog clock with two hands: an hour hand and a minute hand. The two hands form an angle. The angle is measured as the smallest angle between the two hands. The angle between the two hands has a measure that is greater than or equal to 0 and less than or equal to 180 degrees.

Given a sequence of five distinct times written in the format hh : mm , where hh are two digits representing full hours (00 <= hh <= 23) and mm are two digits representing minutes (00 <= mm <= 59) , you are to write a program that finds the median, that is, the third element of the sorted sequence of times in a nondecreasing order of their associated angles. Ties are broken in such a way that an earlier time precedes a later time.

For example, suppose you are given a sequence (06:05, 07:10, 03:00, 21:00, 12:55) of times. Because the sorted sequence is (12:55, 03:00, 21:00, 06:05, 07:10), you are to report 21:00.

Input

The input consists of T test cases. The number of test cases (T) is given on the first line of the input file. Each test case is given on a single line, which contains a sequence of five distinct times, where times are given in the format hh : mm and are separated by a single space.

Output

Print exactly one line for each test case. The line is to contain the median in the format hh : mm of the times given. The following shows sample input and output for three test cases.

Sample Input

3 00:00 01:00 02:00 03:00 04:00 06:05 07:10 03:00 21:00 12:55 11:05 12:05 13:05 14:05 15:05

Sample Output

02:00 21:00 14:05

AC代码：

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
struct node
{
	int h,m;double r;
}k[1000];
bool cmp(node x,node y)
{
	 if(x.r!=y.r)
    return x.r<y.r;
    return x.h<y.h;
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		for(int i=0;i<5;i++)
		{
			scanf("%d:%d",&k[i].h,&k[i].m);
			if(k[i].h>12) k[i].r=fabs(30.0*(k[i].h-12)+k[i].m/2.0-6.0*k[i].m); //不懂此处为何要+k[i].m/2.0 有心的学霸 帮我解答一下
			else
			k[i].r=fabs(30.0*k[i].h+k[i].m/2.0-6.0*k[i].m);
			if(k[i].r>180) k[i].r=360-k[i].r;
		}
		sort(k,k+5,cmp);
		printf("%02d:%02d\n",k[2].h,k[2].m);
		
	}
}