# A - Can you find it?解题报告

A - Can you find it?
Time Limit:3000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

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<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a[501],b[501],c[501],d[250001],L,N,M,k=0,i,j,qq=1,n,S;
while(cin>>L>>N>>M)
{
k=0;
for(i=0;i<L;i++)
cin>>a[i];
for(i=0;i<N;i++)
cin>>b[i];
for(i=0;i<M;i++)
cin>>c[i];
for(i=0;i<L;i++)
for(j=0;j<N;j++)
d[k++]=a[i]+b[j];
sort(d,d+k);
cin>>n;
cout<<"Case "<<qq<<':'<<endl;
for(i=0;i<n;i++)
{
cin>>S;
for(j=0;j<M;j++)
{
int temp=S-c[j];
int left=0,right=k-1,mid;
while(left<right)
{
mid=(left+right)/2;
if(d[mid]==temp)
{
cout<<"YES"<<endl;
goto end;
}
else if(temp>d[mid])
{
left=mid+1;
}
else
{
right=mid;
}
}
}
cout<<"NO"<<endl;
end:;
}
qq++;
}
return 0;
}

• 本文已收录于以下专栏：

## HDU2141：Can you find it?(二分)

Problem Description Give you three sequences of numbers A, B, C, then we give you a number X. Now y...
• libin56842
• 2013年11月24日 14:41
• 3268

## HDU——2141 Can you find it?

Can you find it? Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/10000 K (Java/Others...
• wuxiushu
• 2015年09月01日 11:16
• 502

## A - Can you find it?

Description Give you three sequences of numbers A, B, C, then we give you a number X. Now you need ...
• geekword
• 2016年07月21日 19:35
• 109

## C语言排序(12)___Can you find it?(Hdu 2141)

Problem Description Give you three sequences of numbers A, B, C, then we give you a number X. Now...
• y1196645376
• 2014年12月22日 15:37
• 929

## Intellj Idea 快捷键逐个详说

https://my.oschina.net/happyBKs/blog/689862 https://my.oschina.net/happyBKs/blog/702647 1....
• hotdust
• 2016年10月18日 11:30
• 544

## Python 从入门到实践 7-1 课后习题

7.1 汽车租赁：编写一个程序，询问用户要租赁什么样的汽车，并打印一条消息， 如“Let me see if I can find you a Subaru”。 cars = input...
• qq_38835602
• 2017年12月06日 15:26
• 79

## 杭电acm2071 Max Num

Max Num Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total ...
• WU_DENG9495
• 2017年05月25日 22:12
• 183

## 解决：Cannot find System Java Compiler. Ensure that you have installed a JDK (not just a JRE)

• shenshizhong
• 2017年07月03日 19:05
• 1182

## 那年，我们走过的安卓开发中的那些坑（19:23:50 Generate Signed APK: Errors while building APK. You can find the errors ）

• daojian5173
• 2017年04月02日 13:11
• 4630

## Can not find a java.io.InputStream with the name [downloadFile] in the invocation stack.

1、错误描述八月 14, 2015 4:22:45 下午 com.opensymphony.xwork2.util.logging.jdk.JdkLogger error 严重: Exception ...
• you23hai45
• 2015年08月15日 14:06
• 2102

举报原因： 您举报文章：A - Can you find it?解题报告 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)