hdu 5276(BestCoder Round#46 1001) YJC tricks time

最新推荐文章于 2016-07-25 09:36:18 发布

_NMfloat_

最新推荐文章于 2016-07-25 09:36:18 发布

阅读量402

点赞数

文章标签： acm hdu bestcoder

本文链接：https://blog.csdn.net/NMfloat/article/details/46758747

版权

It's asimple problem.But I hesitate many times.Reading Text is necessary.

The portal:http://acm.hdu.edu.cn/showproblem.php?pid=5276

#include <stdio.h>
#include <string.h>

long long a[15][65][15];

long long  getangle(int  i,int j,int k){
    long long t = i;
    long long m = j;
    long long s = k;
    long long  tt = t * 3600 + m * 60 + s*10;
    long long  angle1 = 1200 * tt;
    long long  angle2 = 100 * tt;
    long long  rule = 360 * 12000;
    long long  angleans = (angle1 - angle2) % rule;
    if(angleans > rule / 2)
        return rule - angleans;
    return angleans;
}

void pre_deal(){
    for(int  i=0;i<=11;i++){
        for(int  j=0;j<=59;j++){
            for(int  k=0;k<=5;k++){
                a[i][j][k] = getangle(i,j,k);
                //printf("%lld\n",a[i][j][k]);
            }
        }
    }
}

void deal(){
    long long aa;
    while(~scanf("%lld",&aa)){
        for(int i=0;i<=11;i++){
            for(int j=0;j<=59;j++){
                for(int k=0;k<=5;k++){
                    if(a[i][j][k] == aa){
                        printf("%02d:%02d:%d0\n",i,j,k);
                    }
                }
            }
        }
    }
}

int main(void){
    pre_deal();
    deal();
    return 0;
}