Kolikot

import itertools

qty = int(raw_input())
coins = sorted([int(x) for x in raw_input().split(" ")])

def viableFor(money):
    result = []
    for coin in coins:
        if coin < money:
            result.append(coin)
        elif coin == money:
            return [coin]
        else:
            return result
    return result

def findSum(money, combinations):
    ln = 2
    while ln < len(combinations) + 1:
        for x in set(list(itertools.combinations(combinations, ln))):
            if money == sum(x):
                return True
        ln = ln + 1
    return False

if coins[0] > 1:
    print("1")
else:
    i = 2
    maxval = sum(coins)
    while i < maxval+1:
        combinations = viableFor(i)
        if len(combinations) == 0:
            break
        elif len(combinations) == 1:
            pass
        else:
            if not findSum(i, combinations):
                break
        i = i + 1
    print(i)

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: RUNTIME ERROR

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED