Any set of n integers form n(n 1)/2 sums by adding every possible pair. The task is to find the n integers given the set of sums.
Any ideas? I've found out the solution but I doubt it the best one... --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
