CD(二分)

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.

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 3
1
2
3
1
2
4
0 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);
    }
}


 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值