A1063. Set Similarity (25)

Given two sets of integers, the similarity of the sets is defined to be N_c/N_t*100%, where N_c is the number of distinct common numbers shared by the two sets, and N_t is the total number of distinct numbers in the two sets. Your job is to calculate the similarity of any given pair of sets.

Input Specification:

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⁴) and followed by M integers in the range [0, 10⁹]. 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.

Output Specification:

For each query, print in one line the similarity of the sets, in the percentage form accurate up to 1 decimal place.

Sample Input:

3
3 99 87 101
4 87 101 5 87
7 99 101 18 5 135 18 99
2
1 2
1 3

Sample Output:

50.0%
33.3%

 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 #include <iostream>
 4 #include <string.h>
 5 #include <string>
 6 #include <math.h>
 7 #include <algorithm>
 8 #include <vector>
 9 #include <set>
10 using namespace std;
11 const int N=51;
12 set<int> st[N];
13
14 void compare(int x,int y)
15 {
16     int total=st[x].size(),same=0;
17     for(set<int>::iterator it=st[y].begin();it!=st[y].end();it++)
18     {
19         if(st[x].find(*it)!=st[x].end())
20         {
21           same++;
22         } else total++;
23     }
24     printf("%.1f%%\n",same*100.0/total);
25 }
26
27 int main(){
28     int n;
29     scanf("%d",&n);
30     for(int i=1;i<=n;i++)
31     {
32         int m;
33         scanf("%d",&m);
34         for(int j=0;j<m;j++)
35         {
36             int temp;
37             scanf("%d",&temp);
38             st[i].insert(temp);
39         }
40     }
41     int k;
42     scanf("%d",&k);
43     for(int i=0;i<k;i++)
44     {
45         int a,b;
46         scanf("%d %d",&a,&b);
47         compare(a,b);
48     }
49
50     return 0;
51 }