Question

In thus problem, we define "set" is a collection of distinct numbers. For two sets A and B,
we define their sum set is a set S(A,B)={a+b|aEA,DEB). 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, C, your task is to find set B of positive integers less than or
equals 100 with maximum size such that S(A,B)=C. It is guaranteed that there is unique such
set
Input Format
The first line contains N denoting the number of elements in set A, the following line
contains N space-separated integers as denoting the elements of set A
The third line contains M denoting the number of elements in set C, the following line
contains M space-separated integers ci denoting the elements of set C.
Output Format
Priut all elements of B in increasing order in a single line, separated by space.
Constraints
.
1 <_NM<_100
1<_ai ,ci<_100​

Answer 1

Answer:

????????

Explanation:

bro this is too long