mirror of
https://github.com/xlucn/PAT.git
synced 2026-10-30 00:37:37 +08:00
27 lines
1.3 KiB
HTML
27 lines
1.3 KiB
HTML
<!DOCTYPE html>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
|
|
<h1>1063. Set Similarity (25)</h1>
|
|
<div id="problemContent">
|
|
<p>Given two sets of integers, the similarity of the sets is defined to be N<sub>c</sub>/N<sub>t</sub>*100%, where N<sub>c</sub> is the number of distinct common numbers shared by the two sets, and N<sub>t</sub> is the total number of distinct numbers in the two sets. Your job is to calculate the similarity of any given pair of sets.</p>
|
|
<p><b>
|
|
Input Specification:
|
|
</b></p>
|
|
<p>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 (<=10<sup>4</sup>) and followed by M integers in the range [0, 10<sup>9</sup>]. 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.</p>
|
|
<p><b>
|
|
Output Specification:
|
|
</b></p>
|
|
<p>For each query, print in one line the similarity of the sets, in the percentage form accurate up to 1 decimal place.</p>
|
|
<b>Sample Input:</b><pre>
|
|
3
|
|
3 99 87 101
|
|
4 87 101 5 87
|
|
7 99 101 18 5 135 18 99
|
|
2
|
|
1 2
|
|
1 3
|
|
</pre>
|
|
<b>Sample Output:</b><pre>
|
|
50.0%
|
|
33.3%
|
|
</pre>
|
|
</div> |