Poj 2840 Big Clock

1.Link：

http://poj.org/problem?id=2840

2.Content：

Big Clock

Time Limit: 1000MS		Memory Limit: 131072K
Total Submissions: 9735		Accepted: 6165

Description

Our vicar raised money to have the church clock repaired for several weeks. The big clock, which used to strike the hours days and nights, was damaged several weeks ago and had been silent since then.

After the clock was repaired, it works all right, but there is still something wrong with it: the clock will strike thirteen times at one o’clock, fourteen times at two o’clock... 24 times at 12:00, 1 time at 13:00...

How many times will it strike now?

Input

The first line consists of only one integer T (T <= 30), representing the number of test cases. Then T cases follow.

Each test case consists of only one line, representing the time now. Each line includes 2 integers H, M separated by a symbol ":". (0 <= H < 24, 0 <= M < 60)

Output

For each test case, output the answer in one line.

Sample Input

3
1:00
01:01
00:00

Sample Output

13
0
12

Source

POJ Monthly--2006.06.25, Lei Tao

3.Method：

4.Code：

 #include<iostream>
 #include <cstdio>

 using namespace std;

 int main()
 {
     int i,n;
     int a,b;
     cin>>n;
     for(i=;i<n;i++)
     {
         scanf("%d:%d",&a,&b);
         if(b!=) cout<<<<endl;
         else
         {
             if(a<=) cout<<(a+)<<endl;
             else cout<<(a-)<<endl;
         }
     }
     //system("pause");
     return ;
 }

5.Reference：