本节a1063 的知识点有如下:
- set容器的构造和元素的插入
set<int> acw[51];
acw[i].insert(e);
- set容器的内容比较
for (set<int>::iterator it = acw[a].begin(); it != acw[a].end(); it++)
{
if (acw[b].find(*it) != acw[b].end()) count++;
}
设置迭代器acw[a]的迭代器it,把他的位置设置为acw[a]的起始点,进行遍历;在acw[b]中寻找it在acw[a]中所指代的值,如果能找到的话,count自增。
#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<set>
using namespace std;
set<int> acw[51];
void cmp(int a, int b){
int count = 0, temp;
double BB;
for (set<int>::iterator it = acw[a].begin(); it != acw[a].end(); it++)
{
if (acw[b].find(*it) != acw[b].end()) count++;
}
temp = acw[a].size() + acw[b].size() - count;
BB = (float)count * 100 / temp;
printf("%.1f%%\n", BB);
}
int main()
{
int N, anum, e;
int i, j;
scanf("%d", &N);
for (i = 0; i < N; i++)
{
scanf("%d", &anum);
for (j = 0; j < anum; j++)
{
scanf("%d", &e);
acw[i].insert(e);
}
}
int m, a, b;
scanf("%d", &m);
for (i = 0; i < m; i++)
{
scanf("%d%d", &a, &b);
cmp(a-1, b-1);
}
return 0;
}