1063 Set Similarity (25 分) 简单set题

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

这题的意思是：

他们的公共元素的个数除去两个集合的元素总个数（不重复），注意保留一个小数。

#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
int main()
{
	set<int> a[50];
	int n,m,i,j,k,t1,t2;
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>m;
		for(j=0;j<m;j++)
		{
			cin>>t1;
			a[i].insert(t1);
		}
	}
	cin>>k;
	for(i=0;i<k;i++)
	{
		cin>>t1>>t2;
		int len=a[t1-1].size(),t=0;
		for(set<int>::iterator id=a[t1-1].begin();id!=a[t1-1].end();id++)
		{
			if(a[t2-1].count(*(id)))
			t++;
		}
//		cout<<t<<"  "<<len<<"  "<<a[t2-1].size()<<endl;
		printf("%.1lf%\n",1.0*t/(a[t1-1].size()+a[t2-1].size()-t)*100.0);
	}
	return 0;
}