1063 Set Similarity (25)（25 分）

1063 Set Similarity (25)（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^4^) and followed by M integers in the range [0, 10^9^]. 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%

题目我有点看不太懂，看了别人的博客

奥求他们的交集/并集....set用下就好

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
set<int>st[55]; 
int main()
{
	int n,m,x,y;
	scanf("%d",&n);
	for(int i = 1;i <= n;i++)
	{
		scanf("%d",&m);
		for(int j =1 ; j <= m; j++)
		{
			scanf("%d",&x);
			st[i].insert(x);//插入..... 
		}
	} 
	scanf("%d",&m);
	while(m--)
	{
		scanf("%d%d",&x,&y);
		int cnt = 0; //表交集
		set<int>::iterator it = st[x].begin();
		while(it!=st[x].end())
		{
			if(st[y].count(*it))
				cnt++;
			it++;
		}
		double d = cnt*1.0 / (st[x].size() + st[y].size() - cnt)*1.0 *100;
		printf("%.1lf%%\n",d);
	}
	return 0;
}