This s a topcoder problem :) On Wed, Feb 23, 2011 at 7:16 PM, bittu <shashank7andr...@gmail.com> wrote: > If pairwise sums of 'n' numbers are given in non-decreasing order > identify the individual numbers. If the sum is corrupted print -1 > Example: > i/p: > 4 5 7 10 12 13 > > o/p: > 1 3 4 9 > > > Thanks & Regards > Shashank > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > >
-- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
