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

思路：
　　1.使用SET自动去重
　　2.注意测试点4 数据很大

#include<cstdio>
#include<set>
using namespace std;

int main() {
	int N = 0;
	scanf("%d", &N);
	set<int> Group[51];
	//N循环录入
	for (int i = 1; i <= N; i++) {
		int a;
		scanf("%d", &a);
		for (int j = 0; j < a; j++) {
			int b;
			scanf("%d", &b);
			Group[i].insert(b);
		}
	}
	/*for (int m=0; m <= N; m++) {
		for (set<int>::iterator it = Group[m].begin(); it != Group[m].end();it++) {
			printf("%d ",*it);
		}
		printf("\n");
	}*/
	int M;
	scanf("%d", &M);
	for (int i = 0; i < M; i++)
	{
		int a, b,c,num;
		num = 0;
		scanf("%d", &a);
		scanf("%d", &b);

		set<int> *zuo, *you;
		zuo = &Group[a];
		you = &Group[b];
		c = Group[a].size() + Group[b].size();
		
		for (auto it = zuo->cbegin(); it != zuo->cend(); it++) {
			if (you->count(*it) == 1) num++;
		}
		
		float d,e,f;
		c -= num;
		f = (float)num/c;
		printf("%0.1f%%\n",f*100);
	}

	//system("pause");
	return 0;
}