Problem:


Score : 600 points

Problem Statement

You are given N integers. The i-th integer is a_i.
Find the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the following condition is satisfied:

Let R, G and B be the sums of the integers painted red, green and blue, respectively. There exists a triangle with positive area whose sides have lengths R, G and B.

Constraints

3 \leq N \leq 300

1 \leq a_i \leq 300(1\leq i\leq N)

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
a_1
:
a_N

Output

Print the number, modulo 998244353, of ways to paint each of the integers red, green or blue so that the condition is satisfied.

Sample Input 1

4
1
1
1
2

Sample Output 1

18

We can only paint the integers so that the lengths of the sides of the triangle will be 1, 2 and 2, and there are 18 such ways.

Sample Input 2

6
1
3
2
3
5
2

Sample Output 2

150

Sample Input 3

20
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9
3
2
3
8
4

Sample Output 3

563038556



Sample input:
4
1
1
1
2


Sample output:
18

Submission status: Runtime Error

Solution code:
N = int(input())
a = [int(input()) for i in range(N)]

sum_ = sum(a)
count = 0
for j in range(2,N):
    for i in list(itertools.combinations(a,j)):
        if(2*sum(i)>sum_):
            for m in range(1,len(i)):
                for k in list(itertloos.combinations(i,m)):
                    if(sum_>2*sum(k) and sum_>2*(sum(i)-sum(k))):
                        count += 1
count = count * 6

Submission status: Runtime Error

Solution code:
n = int(input())
s = list(input())
import collections as coll
t = coll.Counter(s)
b1,w1=t["#"],t["."]

b = 0
w = 0
p = 0
q = 10 ** 18
for i in range(n):
    if s[i] == "#":
        b += 1
    else:
        w += 1
    
    p = b + w1 - w
    if p < q:
        q = p

print(q)

Submission status: Runtime Error

Solution code:
COLORS = "rgb"


class Colored(object):
    def __init__(self, value):
        self.value = int(value)
        self.color_index = 0

    @property
    def color(self):
        return COLORS[self.color_index]

    def shift(self):
        self.color_index = (self.color_index + 1) % len(COLORS)

    def __repr__(self):
        return "<color: %s, value: %s>" % (self.color, self.value)


val_length = int(raw_input())
values = [Colored(raw_input()) for i in range(val_length)]


def judge():
    rs, gs, bs = [], [], []

    for i in values:
        if i.color == "r":
            rs.append(i.value)
        elif i.color == "g":
            gs.append(i.value)
        else:
            bs.append(i.value)

    r, g, b = sum(rs), sum(gs), sum(bs)
    return r + g > b and r + b > g and g + b > r


def shift(pos):
    value = values[pos]
    value.shift()
    if value.color == COLORS[0] and pos + 1 < val_length:
        shift(pos + 1)


pattern = 0
while True:
    if judge():
        pattern += 1

    if all([(i.color == "b") for i in values]):
        break

    shift(0)

print(pattern % 998244353)