1004. Academy Awards
来源:互联网 发布:touch炫舞刷vip软件 编辑:程序博客网 时间:2024/05/18 15:25
Selected from 3,850 teams from 1,329 universities in 68 countries competing at 106 sites and preliminary contests worldwide, sixty-eight teams competed for bragging rights and prizes at The 27th Annual ACM International Collegiate Programming Contest World Finals sponsored by IBM on March 25, 2003, in Hollywood, California. The 2003 World Champion is Warsaw University . And Zhongshan University won the 8th place. During those days, another world famous event was held in the same place. It was the 75th Annual Academy Awards. It’s also known as Oscar.
We always say that the Best Picture is the most important award of all the awards. Before the Oscar Night, we can’t tell which film will win Best Picture. Fortunately, we can dope it out from the Nominee List of all the awards other than the Best Picture. I suggest that you should follow my 3 rules here.
l All the films in the list have chances to win the Best Picture
l The film which will win the Best Picture is the film which has been nominated the most times in the list
l If there are more than one film which have been nominated the most times in the list, we will choose the first one which appears in the list
Let’s see such a List below.
VISUAL EFFECTS
THE LORD OF THE RINGS: THE TWO TOWERS
SPIDER-MAN
STAR WARS EPISODE II ATTACK OF THE CLONES
SOUND EDITING
THE LORD OF THE RINGS: THE TWO TOWERS
MINORITY REPORT
ROAD TO PERDITION
From the list, we can find that THE LORD OF THE RINGS: THE TWO TOWERS has been nominated twice. And each of the other films has been nominated only once. So we can say THE LORD OF THE RINGS: THE TWO TOWERS will win the Best Picture.
Your task is to write a program to figure out the anticipatory winner from the list.
The input file will consist of several lists. The first line of each list contains only one integer n (1≤n≤100), representing the number of awards in the list. Then you get n blocks. Each block indicated the nominees of a distinct award. The first line of each block is the name of the award which is not longer than 80. The second line is mi (1≤mi≤10, 1≤i≤n) - the number of nominated films. In the following lines are mi film names, one per line. For make the question simple, you can assume that there isn’t any space in the film names.
The input is terminated by a line with one zero.
For each list, you are supposed to figure out the winner of Best Picture in a single line.
2VISUAL_EFFECTS3THE_LORD_OF_THE_RINGS:_THE_TWO_TOWERSSPIDER-MANSTAR_WARS_EPISODE_II_ATTACK_OF_THE_CLONESSOUND_EDITING3THE_LORD_OF_THE_RINGS:_THE_TWO_TOWERSMINORITY_REPORTROAD_TO_PERDITION0
THE_LORD_OF_THE_RINGS:_THE_TWO_TOWERS
Problem Source: ZSUACM Team Member
- 1004. Academy Awards
- sicily--1299. Academy Awards
- Sicily 1299. Academy Awards
- Sicily 1299 Academy Awards (map + vector容器)
- python academy
- Video Traffic Academy
- Academy Color Encoding System
- Microsoft virtual academy courses
- [warm-up] MS Academy Search
- 2004 Sitepoint community awards
- Jolts Awards links
- About SIGPLAN awards
- Eclipse Awards 获奖者名单
- Best paper awards
- [zz]eccv 2008 awards
- Awards and Certifications @EMC
- Readers' Choice Awards 2014
- 2011 Open Source Awards
- 二值图的连通区域标记
- 程序员需要有多懒 ?- cocos2d-x 数学函数、常用宏粗整理 - by Glede
- 要找个像素尺真不容易
- 题目1167:数组排序
- iOS中单例的总结
- 1004. Academy Awards
- 求给定数组中最大值和其在数组中的索引并输出
- 更改Chrome Developer Tools的字体
- 1000. Campus
- 面向对象编程中的聚合与耦合
- MFC 网络编程
- 1001. Robot
- hibernate.current_session_context_class
- 1002. Highways