A1063.Set Similarity
来源:互联网 发布:2016网络自制剧排行榜 编辑:程序博客网 时间:2024/05/29 10:32
Given two sets of integers, the similarity of the sets is defined to be Nc/Nt*100%, where Nc is the number of distinct common numbers shared by the two sets, and Nt 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%
Code:
#include "cstdio"#include "set"using namespace std;const int N = 51;set<int> st[N];void compare(int x,int y){ int totalNum = st[y].size(),sameNum = 0; for(set<int>::iterator it = st[x].begin(); it != st[x].end(); it++) { if(st[y].find(*it) != st[y].end()) { sameNum++; } else { totalNum++; } } printf("%.1f%%\n",sameNum * 100.0 / totalNum);}int main(){ int n,k,s1,s2; scanf("%d",&n); for(int i = 1; i <= n; i++) { int m,e; scanf("%d",&m); for(int j = 0; j < m; j++) { scanf("%d",&e); st[i].insert(e); } } scanf("%d",&k); for(int i = 0; i < k; i++) { scanf("%d%d",&s1,&s2); compare(s1,s2); } return 0;}
- A1063. Set Similarity (25)
- A1063. Set Similarity (25)
- A1063.Set Similarity
- PAT-A1063. Set Similarity (25)
- pat-a1063. Set Similarity (25)
- PAT A1063. Set Similarity (25)
- PAT A1063 set similarity (25)
- Set Similarity
- 1063. Set Similarity
- PAT_1063: Set Similarity
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity
- 1063. Set Similarity
- 1063. Set Similarity (25)
- PAT 1063. Set Similarity
- codeforces 792 B. Counting-out Rhyme (模拟链表||约瑟夫环)
- eclipse 面包屑开关
- ios xcode 字体大全
- 学习笔记:SAE TensorFlow代码
- Erlang/OTP: 基于 Behaviour 的回调函数【转】
- A1063.Set Similarity
- 页面的分页(对之前上传的的代码的一种补充)
- Linux(2)简单的导航指令(下)绝对路径和相对路径
- 【JavaScript】2.JavaScript&html
- 算法基础篇(11)------平衡树
- 怪盗基德的滑翔翼
- PopUpWindow使用详解(一)——基本使用
- 怎么就是道DP题呢,666
- Hadoop完全分布式集群搭建手记(CentOS6.7+Hadoop2.6手把手胸贴胸详细版)