PAT甲级1063

博客介绍了PAT甲级1063题目的解题思路,涉及如何计算两个集合的相似度。通过使用C++,文章探讨了数据结构的选择,如set和vector,以及如何优化算法避免超时。作者从最初的set容器尝试转换到vector,并利用find函数提高效率。总结中强调了遍历容器和选择合适数据结构的重要性。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

题目

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 (≤104) and followed by M integers in the range [0,109]. 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%

文章大意

  找出两个集合的相似度,nc就是两个集合中相同的元素个数,nt就是两个集合合并去重后元素的个数

思路

  利用set输入集合,可以做到去重,用vector的数组存储每一个set集合,然后利用find函数找出两个函数相同的元素,设置一个计数器,相同则++

实现

#include <iostream>
#include <stdio.h>
#include <set>
#include <vector>
using namespace std;

int main()
{
   
   
    int n = 0, k, a, b;
    
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值