def no_subset_sum(c):
  n = len(c)
  if n == 0: return True #case: set length is 0
  if (c[0] > 0 or c[n-1] < 0): return True #case: all positive or all negative numbers in set, no zeroes
 
def subset_zero(a):
  #Given a sorted list of distinct integers, write a function that returns whether there are two integers in the list that add up to 0
  if no_subset_sum(a): return False
  n, i = len(a), 0
  while (a[i] <= 0):
    if a[i] == 0: return True
    for t in range(n-1,i,-1):
      if (a[i] + a[t] == 0): return True
    i = i+1
  return False
 
#tests
t1 = [1,2,3]
t2 = [-5,-3,-1,2,4,6]
t3 = []
t4 = [-1,1]
t5 = [-97364, -71561, -69336, 19675, 71561, 97863]
t6 = [-53974, -39140, -36561, -23935, -15680, 0]

ZGVmIG5vX3N1YnNldF9zdW0oYyk6CiAgbiA9IGxlbihjKQogIGlmIG4gPT0gMDogcmV0dXJuIFRydWUgI2Nhc2U6IHNldCBsZW5ndGggaXMgMAogIGlmIChjWzBdID4gMCBvciBjW24tMV0gPCAwKTogcmV0dXJuIFRydWUgI2Nhc2U6IGFsbCBwb3NpdGl2ZSBvciBhbGwgbmVnYXRpdmUgbnVtYmVycyBpbiBzZXQsIG5vIHplcm9lcwoKZGVmIHN1YnNldF96ZXJvKGEpOgogICNHaXZlbiBhIHNvcnRlZCBsaXN0IG9mIGRpc3RpbmN0IGludGVnZXJzLCB3cml0ZSBhIGZ1bmN0aW9uIHRoYXQgcmV0dXJucyB3aGV0aGVyIHRoZXJlIGFyZSB0d28gaW50ZWdlcnMgaW4gdGhlIGxpc3QgdGhhdCBhZGQgdXAgdG8gMAogIGlmIG5vX3N1YnNldF9zdW0oYSk6IHJldHVybiBGYWxzZQogIG4sIGkgPSBsZW4oYSksIDAKICB3aGlsZSAoYVtpXSA8PSAwKToKICAgIGlmIGFbaV0gPT0gMDogcmV0dXJuIFRydWUKICAgIGZvciB0IGluIHJhbmdlKG4tMSxpLC0xKToKICAgICAgaWYgKGFbaV0gKyBhW3RdID09IDApOiByZXR1cm4gVHJ1ZQogICAgaSA9IGkrMQogIHJldHVybiBGYWxzZQoKI3Rlc3RzCnQxID0gWzEsMiwzXQp0MiA9IFstNSwtMywtMSwyLDQsNl0KdDMgPSBbXQp0NCA9IFstMSwxXQp0NSA9IFstOTczNjQsIC03MTU2MSwgLTY5MzM2LCAxOTY3NSwgNzE1NjEsIDk3ODYzXQp0NiA9IFstNTM5NzQsIC0zOTE0MCwgLTM2NTYxLCAtMjM5MzUsIC0xNTY4MCwgMF0=