1063. Set Similarity (25)
来源:互联网 发布:江大教务网络管理系统 编辑:程序博客网 时间:2024/06/12 19:55
1063. Set Similarity (25)
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:33 99 87 1014 87 101 5 877 99 101 18 5 135 18 9921 21 3Sample Output:
50.0%33.3%
#include <stdio.h> #include <stdlib.h> #include <memory.h>#define MAX 10010int a[51][MAX];int cmp(const void *a, const void *b){return *(int*)a - *(int*)b;}int getSize(int x){int size,i,j;size = 1;i = 1;j = 1;while (a[x][i] != -1){if (a[x][i] != a[x][i - 1]){a[x][j] = a[x][i];j++;size++;}i++;}a[x][j] = -1;return size;}void process(int x, int y){int Xsize, Ysize,NC,NT,Xindex,Yindex;int count;double result;Xsize = getSize(x);Ysize = getSize(y);NC = 0;Xindex = 0;Yindex = 0;while (a[x][Xindex] != -1 && a[y][Yindex] != -1){if (a[x][Xindex] > a[y][Yindex]){Yindex++;}else if (a[x][Xindex] < a[y][Yindex]){Xindex++;}else{Xindex++;Yindex++;NC++;}}printf("%.1lf%%\n", (double)NC * 100 / (Xsize + Ysize - NC));}int main(){int N, M, K,x,y;int i,j;//freopen("d://input.txt", "r", stdin);scanf("%d", &N);memset(a, -1, sizeof(a));for (i = 1; i <= N; i++){scanf("%d", &M);for (j = 0; j < M; j++){scanf("%d", &a[i][j]);}qsort(a[i], M, sizeof(a[i][0]), cmp);}scanf("%d", &K);for (i = 0; i < K; i++){scanf("%d%d", &x, &y);process(x, y);}return 0;}
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 1063. Set Similarity (25)
- 最近几个月学习情况的总结
- JS-字符串操作
- ios 清除UIWebImage的缓存
- 原型链终解
- 在eclipse离线安装ADT插件
- 1063. Set Similarity (25)
- 概率中的PDF,PMF,CDF
- HDU 2476 String painter(区间DP)
- 36. Valid Sudoku
- Fragment
- 统计学习方法(二)决策树
- Top K Frequent Elements
- CVE-2014-7911 Android本地提权漏洞分析与利用
- maven+Hibernate mysql驱动无法加载错误