ZJU 1101 Gamblers

I had got WA many times!!

useful test data:

4
10 9 3 -2
4
10 9 3 -4
4
10 9 3 -16

output should be 10, 9, 3 as squence.

//////////////////////////////////////////////////////////////////////////////////////////////

#include <iostream.h>
#include <string.h>
#include <stdlib.h>

#define MAX 1005
int wager[MAX] ;

int cmp ( const void* a, const void* b )
{
 return *(int*)a - *(int*)b ;
}

bool BinarySearch ( int beg, int end, int value )
{
 int mid ;
 while ( beg <= end )
 {
  mid = ( beg + end ) / 2 ;
  if ( wager[mid] > value )
   end = mid-1 ;
  else if ( wager[mid] < value )
   beg = mid+1 ;
  else
   return true ;
 }
 return false ;
}

/*
// this is true also
bool BinarySearch ( int beg, int end, int value )
{
 if ( beg > end )
  return false ;
 int mid = ( beg + end ) / 2 ;
 if ( wager[mid] > value )
  return BinarySearch ( beg, mid-1, value ) ;
 else if ( wager[mid] < value )
  return BinarySearch ( mid+1, end, value ) ;
 return true ;
}*/

int main()
{
 int n ;
 while ( cin >> n && n )
 {
  int i, j, k, cur ;
  for ( i = 0; i < n; i++ )
   cin >> wager[i] ;

  if ( n < 4 )
  {
   cout << "no solution" << endl ;
   continue ;
  }
  qsort ( wager, n, sizeof(int), cmp ) ;
  
  bool isFind = false ;
  for ( i = n-1; i >= 0; i-- )
  {
   for ( j = n-1; j >= 0; j-- )
   {
    if ( j == i || wager[j]+wager[0]+wager[1] > wager[i] )
     continue ;
    for ( k = j-1; k >= 0; k-- )
    {
     if ( k == i )
      continue ;
     cur = wager[i] - wager[j] - wager[k] ;
     if ( BinarySearch ( 0, k-1, cur ) )
     {
      isFind = true ; 
      break ;
     }
    }
    if ( isFind )
     break ;
   }
   if ( isFind )
    break ;
  }
  if ( isFind )
   cout << wager[i] << endl ;
  else
   cout << "no solution" << endl ;
 }
 return 0 ;
}