PAT A1063 Set Similarity

最新推荐文章于 2024-07-29 02:59:08 发布

wdkhuans

最新推荐文章于 2024-07-29 02:59:08 发布

阅读量71

点赞数

本文链接：https://blog.csdn.net/weixin_41809001/article/details/105102771

版权

#include<cstdio> 
#include<algorithm>
#include<set>
#include<cstring>
using namespace std;
const int M = 10010;
set<int> arr[50];
int main(){
	int N,num;
	int value;
	scanf("%d",&N);
	for(int i = 0; i < N; i++){
		scanf("%d",&num);
		for(int j = 0; j < num ; j++){
			scanf("%d",&value);
			arr[i].insert(value);
		}
	}
	int cha_num;
	int first,last;
	int n1,n2,n;
	scanf("%d",&cha_num);
	for(int i = 0; i< cha_num; i++){
		scanf("%d %d",&first,&last);
		first = first - 1;
		last = last - 1;
		n1 = arr[first].size();
		n2 = arr[last].size();
		
		int value_now;
		int chongfu = 0;
		for(set<int>::iterator it = arr[first].begin();it!=arr[first].end();it++){
			value_now = *it;
			if (arr[last].find(value_now) != arr[last].end()) chongfu++;
		}
		double acc = 1.0*chongfu / (n1+n2-chongfu);
		acc = acc * 100;
		printf("%.1f%\n",acc);
	}
}