浙江大学PAT_甲级_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

给定两个集合，输出交集元素个数 / 并集元素个数*100%

利用C++<algorithm>里的set_intersection()函数可以求交集元素。

我的C++代码：

#include<iostream>
#include<set>
#include<vector>
#include <algorithm>
#include<iterator>
using namespace std;
set<int> s[55];
int main()
{
	int n;//集合数量
	int k = 0, x = 0, y = 0;//k比较次数
	float IntersectionElementSum = 0, UnionElementSum = 0;//交集内元素个数，并集内元素个数
	int i = 0, j = 0;
	cin >> n;
	for (i = 1; i <= n; i++)
	{
		int m = 0, temp = 0;//m集合内元素个数
		cin >> m;
		for (j = 1; j <=m; j++)
		{
			cin >> temp;
			s[i].insert(temp);//输入一个集合内的元素
		}
	}
	
	cin >> k;//输入比较次数
	while (k--)
	{
		cin >> x >> y;	//输入比较的集合的序号
		vector<int> intersection;	//存放交集元素
		set_intersection(s[x].begin(), s[x].end(), s[y].begin(), s[y].end(), inserter(intersection, intersection.begin()));
		//获得交集元素
		IntersectionElementSum = intersection.size();//求交集内元素个数
		intersection.clear();//清除交集内所有元素
		UnionElementSum = s[x].size() + s[y].size() - IntersectionElementSum;//求并集内元素个数
		printf("%.1f", IntersectionElementSum / UnionElementSum * 100);//输出百分比
		putchar('%');
		putchar('\n');
	}
	//system("pause");
	return 0;
}