[ create a new paste ] login | about

Link: http://codepad.org/eo44yJLz    [ raw code | output | fork ]

Python, pasted on Aug 13:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
def dfs(i, sum, a, k):

  if i == len(a):
    return sum == k

  if dfs(i+1, sum, a, k):
    return True

  if dfs(i+1, sum+a[i], a, k):
    return True

  return False

def solve(a, k):
  if dfs(0, 0, a, k):
    print "Yes"
  else:
    print "No"

solve([1, 2, 4, 7], 13)
solve([1, 2, 4, 7], 15)


Output:
1
2
Yes
No


Create a new paste based on this one


Comments: