Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Exact Subset Sum

Exact Subset Sum

Difficulty: 1500 2000 ms 128 MB

dp

Is there a subset of the values whose sum is exactly T?

Input: the first line has N and T; the second line has N positive integers.

Output: YES or NO.

Constraints:

  • 1 ≤ N ≤ 100
  • 1 ≤ ai ≤ 100
  • 0 ≤ T ≤ 104

Sample Tests

Input 1
4 9
2 3 5 8
Output 1
NO
Input 2
3 7
2 2 2
Output 2
NO

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen