1063 Set Similarity (25 分)-CSDN博客

本文链接：https://blog.csdn.net/weixin_43482621/article/details/102649594

1063 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%

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<set>
using namespace std;
int main(){
	int N,M,K;
	int x,temp1,temp2;
	set <int> st [60];
	scanf("%d",&N);
	for(int i=1;i<=N;i++){
		scanf("%d",&M);
		for(int j=0;j<M;j++){
			scanf("%d",&x);
			st[i].insert(x);
		}
	}
	scanf("%d",&K);
	for(int i=0;i<K;i++){
		scanf("%d %d",&temp1,&temp2);
		double common=0,sum=0;
		set<int>::iterator it;
		for(it=st[temp1].begin();it!=st[temp1].end();it++){
			if(st[temp2].find(*it)!=st[temp2].end()) common++;//找到了 
		}
		sum=st[temp1].size()+st[temp2].size()-common;
		printf("%.1lf%\n",common*100.0/sum);
//		printf("%f %f\n",common,sum);
	}
	return 0;
}
//两个set里查找 找到就是交集