Apple Division

def rec(n: int, p: list[int], iter: int, S1: int, S2: int) -> int:

    if iter == n-1:
        return abs(S1 - S2)
    
    return min(
        rec(n, p, iter+1, S1, S2),
        rec(n, p, iter+1, S1 - p[iter], S2 + p[iter])
    )

def apple_division(n: int, p: list[int]) -> int:
    return rec(n, p, 0, sum(p), 0)

if __name__ == "__main__":
    n = int(input(""))
    p = [ int(x) for x in input("").split(" ") ]
    print(apple_division(n, p))

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