HDU 5705 Clock （精度控制，暴力）

#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
using namespace std ;
typedef long long LL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f3f;
const double eps = 1e-8;
const int mod = 360*120;
const int maxn = 2000 + 5;
const int dr[] = {0, 0, -1, 1};
const int dc[] = {-1, 1, 0, 0};
int n, m;
inline bool is_in(int r, int c){
    return r >= 0 && r < n && c < m && c >= 0;
}

int main(){
    int h, m, s, t, kase = 0;
    while(scanf("%d:%d:%d", &h, &m, &s) == 3){
        scanf("%d", &t);
        t *= 120;
        int sum = h * 3600 + m * 60 + s;
        int hh = sum % mod;
        int mm = (sum * 12) % mod;
        int ans = 0;

        while(true){
            hh = (hh + 1) % mod;
            mm = (mm + 12) % mod;
            ++ans;
            if(abs(abs(mm-hh) - t) <= 10)  break;
        }

        int sss = (ans + s) % 60;
        int mmm = ((ans+s) / 60 + m) % 60;
        int hhh = (((ans+s) / 60 + m) / 60 + h) % 12;
        printf("Case #%d: %02d:%02d:%02d\n", ++kase, hhh, mmm, sss);
    }
    return 0;
}