1107. Social Clusters (30)-PAT甲级真题

柳婼

已于 2023-11-09 17:25:31 修改

阅读量4.2k

点赞数 14

CC 4.0 BY-SA版权

文章标签： PAT 算法

于 2016-08-12 14:05:59 首次发布

本文链接：https://blog.youkuaiyun.com/liuchuo/article/details/52191082

When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A "social cluster" is a set of people who have some of their hobbies in common. You are supposed to find all the clusters.

Input Specification:

Each input file contains one test case. For each test case, the first line contains a positive integer N (<=1000), the total number of people in a social network. Hence the people are numbered from 1 to N. Then N lines follow, each gives the hobby list of a person in the format:
Ki: hi[1] hi[2] ... hi[Ki]
where Ki (>0) is the number of hobbies, and hi[j] is the index of the j-th hobby, which is an integer in [1, 1000].</