Apple Division

import math
n = int(input())
w = list(map(int, input().split()))

s = sum(w)

def subset(i, w):
    j = 0
    x = 0
    #l = []
    while i > 0:
        if i % 2 == 1:
            x += w[j]
            #l.append(w[j])
        j += 1
        i = i // 2
    return abs(s - x - x)

m = subset(0, w)
for i in range(2**n):
    x = subset(i, w)
    if x < m:
        m = x
        #ml = l
print(m)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED