Give an O (nt) algorithm for the following task.
Input: A list of n positive integers a1, a2,...,an; a positive integer t.
Question: Does some subset of the at’s add up to t? (You can use each atat most once.)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.