Diferente pentru blog/meet-in-the-middle intre reviziile #59 si #60
Nu exista diferente intre titluri.
Diferente intre continut:
if -(c + d) in sums:
print (S[-(c + d)][0], S[-(c + d)][1], c, d)
return
print "No solution."
== This algorithm has $O(n^2^)$ time and space complexity.
