CD(二分)
来源:互联网 发布:python web 上传文件 编辑:程序博客网 时间:2024/05/17 08:24
Problem Description
Jack and Jill have decided to sell some of their Compact Discs, while they still have some value. They have decided to sell one of each of the CD titles that they both own. How many CDs can Jack and Jill sell?
Neither Jack nor Jill owns more than one copy of each CD.
Neither Jack nor Jill owns more than one copy of each CD.
Input
The input consists of a sequence of test cases. The first line of each test case contains two non-negative integers N and M, each at most one million, specifying the number of CDs owned by Jack and by Jill, respectively. This line is followed by N lines listing the catalog numbers of the CDs owned by Jack in increasing order, and M more lines listing the catalog numbers of the CDs owned by Jill in increasing order. Each catalog number is a positive integer no greater than one billion. The input is terminated by a line containing two zeros. This last line is not a test case and should not be processed.
Output
For each test case, output a line containing one integer, the number of CDs that Jack and Jill both own.
Sample Input
3 31231240 0
Sample Output
2
#include<stdio.h>__int64 a[1000005],k;int main(){ int n,m,i,sum,h,d,mid; while(scanf("%d%d",&n,&m)>0&&(n!=0||m!=0)) { sum=0; for(i=0;i<n;i++) scanf("%I64d",&a[i]); while(m--) { scanf("%I64d",&k); h=0;d=n-1; while(h<=d) { mid=(h+d)/2; if(a[mid]>k) d=mid-1; if(a[mid]<k) h=mid+1; if(a[mid]==k) { sum++;break; } } } printf("%d\n",sum); }}
- CD(二分)
- hdu 3763 CD(二分)
- HDU3763 CD 二分
- hdu 3763 CD(二分)
- HDU3763.CD——二分
- hdu 3763 CD(二分查找)
- HDU 3763 CD(二分查找)
- hdu 3763 CD(二分查找)
- hdoj 3763 CD(二分查找)
- ..CD..
- CD
- cd
- cd
- cd
- cd
- cd
- cd
- cd
- 在win7系统下硬盘安装centos6.3----快速安装
- jboss性能优化(一)
- main(int argc , char *argv[])使用
- 使用C4droid和botbrew在andriod手机上编程
- C++学习笔记--指针和多维数组
- CD(二分)
- vim.c 使用
- django实例:创建你的第一个应用投票系统(3)后台管理
- hdu 1254 推箱子 很好的嵌套搜索 双层BFS
- 分享代码
- DataTable合并
- hdu4321(贪心)
- 2013-5月ACM比赛的总结
- django实例:用创建你的第一个应用投票系统