Giới thiệu
def find_subset_with_sum(arr, k):
n = len(arr)
def backtrack(start, path, current_sum):
if current_sum == k:
return path
for i in range(start, n):
if current_sum + arr[i] <= k:
result = backtrack(i + 1, path + [arr[i]], current_sum + arr[i])
if result:
return result
return None
return backtrack(0, [], 0)
ar = list(map(int,input().split()))
m = ar[1]
a = list(map(int,input().split()))
sub=find_subset_with_sum(a,m)
c=[]
for x in a:
if x in sub:
c.append(1)
else:
c.append(0)
print(*c)