2.6英语翻译打卡

链接：Girls and Boys | JXNUOJ

the second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved”(恋爱) is defined between one girl and one boy. For the study reasons it is necessary to find out the maximum set satisfying the condition: there are no two students in the set who have been “romantically involved”. The result of the program is the number of students in such a set.

浪漫指数在一男一女之间被定义---恋爱发生在一男一女的身上。需要找出符合以下条件的最大集合：某对男女生不能是已经恋爱的。需要输出集合中的元素个数。
The input contains several data sets in text format. Each data set represents one set of subjects of the study, with the following description:
the number of students
the description of each student, in the following format
student_identifier:(number_of_romantic_relations) student_identifier1 student_identifier2 student_identifier3 ...
or
student_identifier:(0)
The student_identifier is an integer number between 0 and n-1, for n subjects.
For each given data set, the program should write to standard output a line containing the result.

输入包含多个文本格式的数据集。每个数据集代表一组研究对象，描述如下：

学生的数量

描述每个学生，在下述的总体安排中：

序号：（浪漫关系的个数）学生的序号

或是  序号：（0）后面没有对应序号

学生的序号应从0开始，到n-1.

对于每组数据，标准的输出结果。

7
0: (3) 4 5 6
1: (2) 4 6
2: (0)
3: (0)
4: (2) 0 1
5: (1) 0
6: (2) 0 1
3
0: (2) 1 2
1: (1) 0
2: (1) 0

样例输出：

5
2