|
||||||||||
Watch Channel[V]Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 671 Accepted Submission(s): 351 Problem Description When talking about entertainment,Samuel prefers listening to music than anything else. Of all the Chinese singers,Samuel mostly enjoys the songs of Taiwan girl band S.H.E. Do you have any likes and dislikes in choosing whose songs to enjoy?And Samuel is fond of watching Channel[V].But Samuel has a bad habit. When the singer does not match his taste,he will immediately switch the channel. Samuel likes S.H.E,Jay,Elva,Jolin,Aska,and Yoga(Pay more attention to the spelling please!Use them according to what Samuel gives you or you may get wrong answer). Suppose Samuel don't like any other singers., you are asked to tell how long will Samuel stay in front of the TV according to a list of the MVs that are planned to be broadcast in Channel[V]. Input The input will be 2 part: the first line only contain a number t,which means the number of test cases. The first line of each test case will be the n MVs that will be broadcast,and each of the following n lines will be the MV's singer and each of the MV will take MM:SS time. Output Output in this format¡±Samuel will watch Channel[V] for H hour(s),M minute(s),S second(s).¡± Sample Input
Sample Output
Author Samuel Source | ||||||||||
|