1063. Set Similarity (25)
2017-07-24 23:00
369 查看
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:
Sample Output:
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%
#include<iostream> #include<set> #include<cstdio> using namespace std; int main() { int n,num,nu,a,b; set<int> s[10000]; cin>>n; for (int i=1;i<=n;i++) { scanf("%d",&num); for (int j=0;j<num;j++) { scanf("%d",&nu); s[i].insert(nu); } } int k; cin>>k; for (int i=0;i<k;i++) { scanf("%d %d",&a,&b); int nt=s[b].size(); 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()) nc++; else nt++; } printf("%.1f%%\n",100.0*nc/nt); } return 0; }
相关文章推荐
- 1063. Set Similarity (25)
- 浙江大学PAT_甲级_1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)遍历map
- PAT (Advanced Level) 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- Python实现PAT 1063. Set Similarity (25)
- 1063. Set Similarity (25)【集合操作】——PAT (Advanced Level) Practise
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- PAT (Advanced Level) Practise 1063 Set Similarity (25)
- PAT 1063. Set Similarity (25)
- PAT (Advanced Level) 1063. Set Similarity (25) set的相似度
- 1063. Set Similarity (25)
- PAT-A 1063. Set Similarity (25)
- PAT A 1063. Set Similarity (25)
- PAT甲题题解-1063. Set Similarity (25)-set的使用