HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Non-linear Data structures: Map, Set, Priority Queues > problem:


50869 - Birthday Celebration

Guest
• Review clarifications (1)

Section problems

• 50795 - Trunk
• 50985 - Books Waiting
• 50995 - Group Average
• 50983 - Course Selection
• 50517 - Confusion Matrix
• 50789 - Number of Cities
• 50993 - Products in store
• 50987 - Very Looong Queue
• 50869 - Birthday Celebration
• 50981 - Top popular m-students
• 50794 - Writing Files Into HDD
• 51000 - Book Index
• 51024 - Total Stock Price
• 51023 - Preparing Keyword Index
• 50706 - The most crowded Club
• 50793 - Top M Customers
• 50569 - 12th Grade Elective Subjects

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.

Birthday Celebration

Question: The director of North West Durres primary school wants a special program from you. He has the birthdays of students in a file. Whenever he gives a month, he wants to see the number of students who was born on the given month.

Input specification
You will be first given a number (n) the number of students where 0 ≤ n ≤ 5000. Then in the following n lines, you will be given names and birthdays for n students. The last line contains the searching month.

Output specification:
Show the number of students who was born in the given month. Print 0 (zero), if there is no one.

Sample Input I
10
Kelly 4 Aug 2005
Tamara 10 Jan 2006
Jeffrey 8 Jul 2005
Edwin 13 Apr 2006
Terence 12 Sep 2006
Amos 19 May 2006
Wayne 7 Oct 2006
Rafael 6 Mar 2006
Hubert 25 Jul 2005
Carmen 14 Jan 2006
Oct
Sample Output I
1



Для отправки решений необходимо выполнить вход.

www.contester.ru