Can you find it? hdu 2141

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<cstdio>#include<cmath>#include<algorithm>using namespace std;int sum[550*550];int fun(int a[],int s,int t){int left,right,mid;left=0;right=s-1;while(left<=right){mid=(left+right)/2;if(sum[mid]==t){return 1;}else if(sum[mid]>t){right=mid-1;}else{left=mid+1;}}return 0;}int main(){int a,b,c,d[550],e[550],f[550],k,i,j,ans,g,h,l;k=1;while(scanf("%d %d %d",&a,&b,&c)!=EOF){for(i=0;i<a;i++)scanf("%d",&d[i]);for(i=0;i<b;i++)scanf("%d",&e[i]);for(i=0;i<c;i++)scanf("%d",&f[i]);ans=0;for(i=0;i<a;i++){for(j=0;j<b;j++)sum[ans++]=d[i]+e[j];}sort(sum,sum+ans);scanf("%d",&g);printf("Case %d:\n",k++);while(g--){scanf("%d",&h);int flag=1;for(i=0;i<c;i++){l=h-f[i];if(fun(sum,ans,l)){printf("YES\n");flag=0;break;}}if(flag)printf("NO\n");}}return 0;}