暴力 BestCoder Round #46 1001 YJC tricks time

题目传送门

 /*
     暴力：模拟枚举每一个时间的度数
     详细解释：http://blog.csdn.net/enjoying_science/article/details/46759085
     期末考结束第一题，看看题解找找感觉:)
 */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <vector>
 #include <iostream>
 using namespace std;

 typedef long long ll;
 const int MAXN = 1e3 + ;
 const int INF = 0x3f3f3f3f;

 int main(void)        //BestCoder Round #46 1001 YJC tricks time
 {
     // freopen ("A.in", "r", stdin);

     int n;
     while (scanf ("%d", &n) == )
     {
         for (int i=; i<=; ++i)
         {
             for (int j=; j<=; ++j)
             {
                 for (int k=; k<=; k+=)
                 {
                     ll di = (i *  + j *  + k) * ;    //不是很懂
                     ll dj = (j *  + k) * ;
                     ll t = abs (di - dj);
                     if (t > )    t =  - t;    //劣角
                     if (t == n)
                     {
                         printf ("%02d:%02d:%02d\n", i, j, k);
                     }
                 }
             }
         }
     }

     return ;
 }