标签：acm   hdu   

Clock

4
00:00:00
06:00:00
12:54:55
04:40:00

0 0 0 
180 180 0 
1391/24 1379/24 1/2 
100 140 120 
Hint
每行输出数据末尾均应带有空格

/*
 * In the name of god (^_^)
 */
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cmath>
#include<stdlib.h>
#include<map>
#include<set>
#include<time.h>
#include<vector>
#include<queue>
#include<string>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define eps 1e-8
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
typedef pair<int , int> pii;
int h, m, s;
int t[4];
int ans[3];
int gcd(int a, int b)
{
    return b == 0 ? a : gcd(b, a % b);
}
int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d:%d:%d", &h, &m, &s);
        t[3] = s * 720;
        t[2] = m * 720 + s * 12;
        t[1] = (h % 12) * 3600 + m * 60 + s;
        ans[0] = abs(t[1] - t[2]);
        ans[1] = abs(t[1] - t[3]);
        ans[2] = abs(t[2] - t[3]);
        for(int i = 0; i < 3; i++)
        {
            if(ans[i] > 180 * 120) ans[i] = 360 * 120 - ans[i];
            if(ans[i]%120 == 0)
                printf("%d ", ans[i]/120);
            else
            {
                int tmp = gcd(ans[i], 120);
                printf("%d/%d ", ans[i]/tmp, 120/tmp);
            }
        }
        printf("\n");
    }
    return 0;
}
/*
4
00:00:00
06:00:00
12:54:55
04:40:00
*/

HDU 多校 VIII 1008 clock

标签：acm   hdu   

原文地址：http://blog.csdn.net/dojintian/article/details/47623525