C语言排序--Can you find it?(Hdu 2141)
2014-12-23 09:25:39         来源：y1196645376的专栏

Problem Description Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X.
Input There are many cases. Every data case is described as followed: In the first line there are three integers L, N, M, in the second line there are L integers represent the sequence A, in the third line there are N integers represent the sequences B, in the forth line there are M integers represent the sequence C. In the fifth line there is an integer S represents there are S integers X to be calculated. 1<=L, N, M<=500, 1<=S<=1000. all the integers are 32-integers.
Output For each case, firstly you have to print the case number as the form "Case d:", then for the S queries, you calculate if the formula can be satisfied or not. If satisfied, you print "YES", otherwise print "NO".
Sample Input
```3 3 3
1 2 3
1 2 3
1 2 3
3
1
4
10```
Sample Output
```Case 1:
NO
YES
NO```

```#include
#include
using namespace std;
int a[501],b[501],m[250001],c[501],flag;
void find(int a[],int b,int n)
{
int left,right,mid;
left=0,right=n-1;
while(left<=right)
{
mid=(left+right)/2;
if(a[mid]==b)
{
flag=1;
break;
}
else if(a[mid]>b)
right=mid-1;
else
left=mid+1;
}
}
int main()
{
int i,j,k,n1,n2,n3,n4,ci=0;
while(scanf("%d%d%d",&n1,&n2,&n3)!=EOF)
{
ci++;
for(i=0;i

```