FunkyM-?

Hiiiiiiii

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)

Nothing here

var n,m,i,x:longint;
a:array[1..1000] of longint;
tep1,tep2:text;
begin
assign(tep1,'YAL.inp'); reset(tep1);
assign(tep2,'YAL.out'); rewrite(tep2);
readln(tep1,n,m);
for i:=1 to m do
begin
read(tep1,x);
a[x]:=a[x]+1;
end;
for i:=1 to n do
if a[i]=0 then write(tep2,i,' ');
close(tep1);
close(tep2);
end.

Oak91%9@‘ §91’sias oaks§¥¥pw92jja;

My name is Long