-
热度指数:4863
时间限制:C/C++ 1秒,其他语言2秒
空间限制:C/C++ 64M,其他语言128M
-
算法知识视频讲解
Given two sets of integers, the similarity of the sets is defined to be
Nc/Nt*100%, where Nc is the number of distinct common numbers shared by
the two sets, and Nt is the total number of distinct numbers in the two
sets. Your job is to calculate the similarity of any given pair of sets.
输入描述:
Each input file contains one test case. Each case first gives a positive integer N (<=50) which is the total number of sets. Then N lines follow, each gives a set with a positive M (<=104) and followed by M integers in the range [0, 109]. After the input of sets, a positive integer K (<=2000) is given, followed by K lines of queries. Each query gives a pair of set numbers (the sets are numbered from 1 to N). All the numbers in a line are separated by a space.
输出描述:
For each query, print in one line the similarity of the sets, in the percentage form accurate up to 1 decimal place.
示例1
输入
3
3 99 87 101
4 87 101 5 87
7 99 101 18 5 135 18 99
2
1 2
1 3