F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

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
1 3 S.H.E 03:40 Jay 04:50 Elva 05:35
 

Sample Output
Samuel will watch Channel[V] for 0 hour(s),14 minute(s),5 second(s).
 

Author
Samuel
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-06-27 01:30:18, Gzip enabled