Начало
Рабочее место участника
| Выбрать соревнование | Задачи | Послать решение | Результаты проверки | Статистика по задачам | Вопросы и ответы | Результаты соревнования | Состояние сервера | Изменить данные | Управление командой | Помощь |
Задачи
1040. Conformity
СортировкаОлимпиадные задачи на английском языке
| 03/07/2008 | Лето 2008 дорешивание (12G) |
| 28/07/2008 | Лето 2008 - 12 (G) |
| 24/07/2013 | Лето 2013-16 (командная) (G) |
Ограничения: время – 2s/4s, память – 64MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод 
Послать решение Blockly Посылки Темы Где Обсудить (0)
Frosh commencing their studies at Waterloo have diverse interests,
as evidenced by their desire to take various combinations of courses from
among those available.
University administrators are uncomfortable with this situation, and
therefore wish to offer a conformity prize to frosh who choose one of
the most popular combinations of courses. How many frosh will win
the prize?
The input consists of several test cases followed by a line containing
0. Each test case begins with an integer `1\ ≤\ n\ ≤\ 10\ 000`, the number of
frosh. For each frosh, a line follows containing the course numbers
of five distinct courses selected by the frosh. Each course number is
an integer between 100 and 499.
The popularity of a combination is the number of frosh selecting
exactly the same combination of courses. A combination of courses
is considered most popular if no other combination has higher
popularity.
For each line of input, you should output a single line
giving the total number of students taking some combination of courses that
is most popular.
Sample Input
3 100 101 102 103 488 100 200 300 101 102 103 102 101 488 100 3 200 202 204 206 208 123 234 345 456 321 100 200 300 400 444 0
Output for Sample Input
2 3
