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去重。然后遍历找交集和并集

#include<iostream>  
#include<cstring>  
#include<cstdio>  
#include<set>  
#include<stack>  
#include<algorithm>  
#include<vector> 
#include<map>
using namespace std;
int main(){
	int n;
	cin>>n;
	set<int> s[10000];
	for(int i=1;i<=n;i++){
		int num;
		scanf("%d",&num);
		for(int j=0;j<num;j++){
			int fz;
			scanf("%d",&fz);
			s[i].insert(fz);
		}
	}
	int m;
	cin>>m;
	for(int i=0;i<m;i++){
		int a,b;
		scanf("%d %d",&a,&b);
		int nt=s[b].size();
		//cout<<s[a].size()<<" "<<s[b].size()<<endl;
		int nc=0;
		set<int>::iterator it;
		for(it=s[a].begin();it!=s[a].end();it++){
			if(s[b].find(*it)!=s[b].end()){
			//	cout<<*it<<" ";
				nc++;
			} 
			else{
				nt++;
			}
		}
		printf("%.1f%%\n",100.0*nc/nt);
	}
	return 0;
}