Sum of Numbers
Practice
4.1 (47 votes)
Approved
Easy
Math
Open
Problem
48% Success 10491 Attempts 20 Points 3s Time Limit 256MB Memory 1024 KB Max Code
Given an array of N elements, check if it is possible to obtain a sum of S, by choosing some (or none) elements of the array and adding them.
Input:
First line of the input contains number of test cases T. Each test case has three lines.
First line has N, the number of elements in array.
Second line contains N space separated integers denoting the elements of the array.
Third line contains a single integer denoting S.
Output:
For each test case, print "YES" if S can be obtained by choosing some(or none) elements of the array and adding them. Otherwise Print "NO".
Note that 0 can always be obtained by choosing none.
Constraints
1 ≤ T ≤10
1 ≤ N ≤ 15
-10^6 ≤ A[i] ≤ 10^6 for 0 ≤ i < N
Submissions
Please login to view your submissions
Similar Problems
Points:20
15 votes
Tags:
SortingBasic ProgrammingBit ManipulationMerge SortBasics of Bit ManipulationAlgorithmsBit manipulationBitmask
Points:20
131 votes
Tags:
Bit manipulationEasyOpenSorting
Points:20
110 votes
Tags:
Basic ProgrammingBit manipulationEasy
Editorial