C练习——stl——set——Set Similarity（A1063）

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.

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 (≤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.

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%

结尾无空行

#include<iostream>
using namespace std;
#include<algorithm>
#include<string.h>
#include<vector>
#include<set>


int main()
{
    set<int> s[60];
    int n,k,l,x,a,b;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&l);
        for(int j=0;j<l;j++){
            scanf("%d",&x);
            s[i].insert(x);
        }
    }
    scanf("%d",&k);
    for(int i=0;i<k;i++){
        scanf("%d%d",&a,&b);
        int sum1=0,sum2=s[b].size();      //一开始设交集大小为0，并集大小为b集合大小
        for(set<int>::iterator it=s[a].begin();it!=s[a].end();it++){    //遍历a集合
            if(s[b].find(*it)!=s[b].end())  sum1++;   //如果相等，交集+1
            else    sum2++;                           //如果不等，并集+1
        }
        if(i)   printf("\n");
        printf("%.1f%%",sum1*100.0/sum2);
    }
    return 0;
}