PAT (Advanced Level) 1063. Set Similarity (25) set的相似度

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%

判断两个set的相似度。

/*2015.7.28cyq*/
#include <iostream>
#include <vector>
#include <set>
#include <fstream>
using namespace std;

//ifstream fin("case1.txt");
//#define cin fin

double f(const set<int> &a,const set<int> &b){
	double n1=a.size();
	double n2=b.size();
	int count=0;
	for(auto it=a.begin();it!=a.end();it++){
		if(b.find(*it)!=b.end()){//共有元素
			count++;
		}
	}
	return count/(n1+n2-count)*100;
}

int main(){
	int N;
	cin>>N;
	set<int> level;
	vector<set<int> > datas;
	int M,x;
	while(N--){
		cin>>M;
		while(M--){
			cin>>x;
			level.insert(x);
		}
		datas.push_back(level);
		level.clear();
	}

	int K;
	cin>>K;
	int a,b;
	while(K--){
		cin>>a>>b;
		printf("%.1f%%\n",f(datas[a-1],datas[b-1]));
	}
	return 0;
}