HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Linear Data structures: Stacks, Queues, Linked Lists, etc > problem:


51086 - Top popular student

Section problems

• 50262 - Brackets
• 50291 - Postfix Arithmetic Expressions
• 50286 - Remove Duplicates
• 50775 - Balanced Parenthesis
• 50340 - Game 19
• 50877 - Friendly Queue
• 51086 - Top popular student
• 50774 - Hot Potato
• 50777 - Dwarfs Maze
• 50781 - ReversesreveR
• 50780 - Hot Potato - Revisited
• 50564 - Mother's Milk Buckets
• 50636 - Brackets
• 50776 - The number of different pa...
• 50779 - The shortest path in a maze

Feedback

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

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

Top popular student

Question: For a contest, you are searching for the top-m popular students of the university. You are given friends list of n students where some students may appear several times. Count the unique number of friends for each student and identify the top popular student who has the most number of friends.

Input specification You will be given an integer in the beginning: the number of students (n). In each of the following n lines, you will be given several positive integers (friends of the current student) ending with a negative number where 0 ≤ n ≤ 8,000.

Output specification: Show the ID (order of appearance) of top student who has the most number of friends. If there are several students with the same number friends, first show the student with a smaller ID.

Sample Input
7
5 5 7 7 1 -1
6 4 2 5 6 -1
6 6 7 4 5 4 -1
2 7 1 1 7 7 6 5 -1
3 6 4 7 -1
7 6 6 1 7 -1
3 4 5 2 5 1 1 -1
Sample Output
4

Explanation: Here is the list of students with their number of friends.
  1 -> 3
  2 -> 4
  3 -> 4
  4 -> 5
  5 -> 4
  6 -> 3
  7 -> 5



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

www.contester.ru