How to solve this problem?

Revision en1, by crap_bag, 2018-09-10 19:01:55

For two sets A and B , we define their sum set is a set S(A,B) = {a+b | a∈A, b∈B}. In other word, set S(A,B) contains all elements which can be represented as sum of an element in A and an element in B. Given two sets A and C, your task is to find set B with minimum size such that S(A,B) = C.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English crap_bag 2018-09-10 19:01:55 320 Initial revision (published)