HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Data Structures > problem:


51082 - Sum is equal to K - 1

Guest
• Review clarifications (1)

Volume problems

• 51010 - Max Sequential Sum
• 50772 - The Path of a Node
• 50936 - Saving the Soldiers
• 51086 - Top popular student
• 51015 - Student Scholarships
• 50828 - Arranging Time Table
• 50447 - Swimming Contest - 2
• 51072 - Castle on chessboard
• 51082 - Sum is equal to K - 1
• 50794 - Writing Files Into HDD
• 51020 - Number of nodes removed
• 51023 - Preparing Keyword Index
• 50929 - Present from your uncles
• 51075 - Shortest Path for Bishop
• 50863 - Total Access Cost of a BST
• 50979 - Minimum access cost for BST
• 50688 - Epoka Furgon

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.

Sum is equal to K - 1

Math professor of your brother gave a homework for kids. The professor gives n numbers, and he asks if number k can be produced by adding or subtracting any given number.

Question: Write a program that is going to get information and decide if it's possible to calculate the given number k or not.

Input specification
In the first line, you will be given two integers: The number of numbers(n) and the number (k) to calculate where 0 ≤ n ≤ 17 and -20,000 ≤ k ≤ 20,000. Then, in the following line, you will be given n integers where each number is between -10,000 and 10,000.

Output specification:
Show "No", if it is not possible to calculate k. Otherwise, show "Yes". Note: Each input number can be used only once.

Sample Input I
4 7
1 2 3 5
Sample Input II
4 8
1 2 3 10
Sample Output I
Yes
Sample Output II
Yes

Explanation: For sample input 1: 5 + 2 = 7 or 5 + 3 - 1 = 7
For sample input 2: 10 - 2 = 8 or 10 - 3 + 1 = 8



Для отправки решений необходимо выполнить вход.

www.contester.ru