【HDOJ】2395 Alarm Clock

水题。

 /* 2395 */
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>

 #define MAXL 20

 char src[MAXL], des[MAXL];

 int min(int a, int b) {
     return a<b ? a:b;
 }

 int abs(int x) {
     return x< ? -x:x;
 }

 int main() {
     int t;
     int sh, sm1, sm0;
     int dh, dm1, dm0;
     int i, j, k, tmp;
     int ans;

     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
     #endif

     scanf("%d", &t);
     while (t--) {
         scanf("%s %s", src, des);
         ans = ;

         // handle source
         k = strchr(src, ':') - src;
         sh = ;
         for (i=; i<k; ++i)
             sh = *sh + src[i]-'';
         sm1 = src[k+] - '';
         sm0 = src[k+] - '';

         // handle des
         j = strchr(des, ':') - des;
         dh = ;
         for (i=; i<j; ++i)
             dh = *dh + des[i]-'';
         dm1 = des[j+] - '';
         dm0 = des[j+] - '';

         // calculate ans
         if (des[j+] != src[k+])
             ++ans;
         ans += min(abs(sm0-dm0), -abs(sm0-dm0));
         ans += min(abs(sm1-dm1), -abs(sm1-dm1));
         ans += min(abs(sh-dh), -abs(sh-dh));

         if (ans == )
             printf("Going from %s to %s requires %d push.\n", src, des, ans);
         else
             printf("Going from %s to %s requires %d pushes.\n", src, des, ans);
     }

     return ;
 }