input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
S = [int(eval(input())) for _ in range(N)]
ans = 0
# bit 全探索する
for bit in range(1 << N):
sum = 0
for i in range(N):
# bit にi 番目のフラグが立っているかどうか
if bit & (1 << i):
# フラグが立っているならsumに加算する
sum += S[i]
if sum % 10 == 0:
sum = 0
ans = max(ans, sum)
print(ans) | N = int(eval(input()))
S = [int(eval(input())) for _ in range(N)]
ans = sum(S)
if ans % 10 == 0: # 10の倍数の時
min_s = float('inf')
for s in S: # sの中から, 10の倍数でない、かつ最小のものを探してくる
if s % 10 != 0:
min_s = min(min_s, s)
if min_s == float('inf'): # sの中に10の倍数でないものがなかったとき
ans = 0
else:
ans -= min_s
print(ans)
| p03699 |
import sys
n, *s = list(map(int, sys.stdin.read().split()))
def main():
res = sum(s)
if res % 10:
return res
else:
not_multiple_of_10 = [x for x in s if x % 10]
if not_multiple_of_10:
return res - min(not_multiple_of_10)
else:
return 0
if __name__ == '__main__':
ans = main()
print(ans) | import sys
n, *a = list(map(int, sys.stdin.read().split()))
def main():
s = sum(a)
if s % 10: ans = s
else:
m = min([101] + [x for x in a if x % 10])
if m == 101: ans = 0
else: ans = s - m
print(ans)
if __name__ == '__main__':
main() | p03699 |
N = int(eval(input()))
s = []
for _ in range(N):
s += [int(eval(input()))]
ans = 0
for i in range(2 ** N):
tmp = 0
for j in range(N):
if (i >> j) & 1:
tmp += s[j]
if tmp%10 == 0:
tmp = 0
ans = max(ans, tmp)
print (ans) | #Nの最大値が100なのでbit-DPでは間に合わない
N = int(eval(input()))
s = []
total = 0
for _ in range(N):
a = int(eval(input()))
s += [a]
total += a
s.sort()
if total % 10 != 0:
print (total)
exit()
else:
for i in range(N):
if s[i]%10 != 0:
print((total - s[i]))
exit()
print((0))
| p03699 |
# ABC063c
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
def dfs(i, su):
if i == n:
return su if su % 10 != 0 else 0
return max(dfs(i+1, su+s[i]), dfs(i+1, su))
print((dfs(0, 0)))
| # ABC063c
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s.sort()
ans = sum(s)
if ans % 10 != 0:
print(ans)
exit(0)
for i in s:
if i % 10 != 0:
ans -= i
print(ans)
exit(0)
print((0))
| p03699 |
n = int(eval(input()))
ten = []
notten = []
for _ in range(n):
s = int(eval(input()))
if s % 10:
notten.append(s)
else:
ten.append(s)
ans = sum(notten) + sum(ten)
if notten and sum(notten) % 10 == 0:
print((ans - min(notten)))
elif ans % 10 == 0:
print((0))
else:
print(ans)
| n = int(eval(input()))
s = []
for _ in range(n):
i = int(eval(input()))
s.append(i)
s.sort()
ans = sum(s)
if ans % 10 == 0:
for i in s:
if i % 10 != 0:
ans -= i
print(ans)
break
else:
print((0))
else:
print(ans) | p03699 |
def myAnswer(N:int,S:list) -> int:
ans = []
for s in S:
if(s % 10 != 0):
ans.append(s)
ans.sort()
ans = list(set(ans))
total = sum(S)
if(total % 10 == 0):
if(ans != []):
return total - ans[0]
else:
return 0
else:
return total
def modelAnswer():
return
def main():
N = int(eval(input()))
S = [int(eval(input())) for _ in range(N)]
print((myAnswer(N,S[:])))
if __name__ == '__main__':
main() | def myAnswer(N:int,S:list) -> int:
MIN = 0
total = sum(S)
S.sort()
for s in S:
if(s % 10 != 0):
MIN = s
break
if(total % 10 == 0):
if(MIN != 0):
return total - MIN
else:
return 0
else:
return total
def modelAnswer():
return
def main():
N = int(eval(input()))
S = [int(eval(input())) for _ in range(N)]
print((myAnswer(N,S[:])))
if __name__ == '__main__':
main() | p03699 |
import itertools
N = int(eval(input()))
s = [0] * N
answer = 0
for i in range(N):
s[i] = int(eval(input()))
for i in range(1, N+1): # 何問正解するか、0からN問まで
for v in itertools.combinations(s, i):
if sum(v) % 10 != 0 and answer <= sum(v):
answer = sum(v)
# print(v, sum(v))
print(answer)
| import itertools
N = int(eval(input()))
s = [0] * N
not10 = []
answer = 0
for i in range(N):
s[i] = int(eval(input()))
SUM = sum(s)
if SUM % 10 != 0:
print(SUM)
exit()
else:
for i in range(N):
if s[i] % 10 != 0:
not10.append(s[i])
not10.sort()
if len(not10) == 0:
print((0))
else:
print((SUM - not10[0]))
exit()
# print(not10)
# for i in range(1, N+1): # 何問正解するか、0からN問まで
# for v in itertools.combinations(s, i):
# if sum(v) % 10 != 0 and answer <= sum(v):
# answer = sum(v)
# print(v, sum(v))
# print(answer)
| p03699 |
import itertools
N=int(eval(input()))
A=[0]*N
for i in range(N):
A[i]=int(eval(input()))
m=0
for i in range(N):
n=N-i
L=list(itertools.combinations(A,n))
L=sorted(L)
for j in range(len(L)):
#print(L[-1-j])
c=sum(L[-1-j])
if(c%10!=0):
m=max(c,m)
break
print(m) | import itertools
N=int(eval(input()))
A=[0]*N
for i in range(N):
A[i]=int(eval(input()))
m=sum(A)
if(m%10==0):
A=sorted(A)
for a in A:
if a%10!=0:
print((m-a))
exit()
print((0))
else:
print(m)
| p03699 |
n=int(eval(input()))
s=[]
for i in range(n):
s.append(int(eval(input())))
ans=0
for i in range(2**n):
score=0
for j in range(n):
if i>>j&1:
score+=s[j]
if score%10!=0:
ans=max(ans,score)
print(ans)
| n=int(eval(input()))
s=[]
for i in range(n):
s.append(int(eval(input())))
s.sort()
if sum(s)%10==0:
for i in range(n):
if s[i]%10!=0:
print((sum(s)-s[i]))
exit()
print((0))
exit()
print((sum(s)))
| p03699 |
def main():
n = int(eval(input()))
s = []
for _ in range(n):
ss = int(eval(input()))
s.append(ss)
sm = sum(s)
if sm % 10 != 0:
print(sm)
return
s.sort()
for i, ss in enumerate(s):
if ss % 10 != 0:
print((sm - ss))
return
print((0))
if __name__ == '__main__':
main()
|
def main():
n = int(eval(input()))
s = []
for _ in range(n):
ss = int(eval(input()))
s.append(ss)
total = sum(s)
if total % 10 != 0:
print(total)
return
s.sort()
for i, ss in enumerate(s):
if ss % 10 != 0:
print((total-ss))
return
print((0))
if __name__ == '__main__':
main()
| p03699 |
N = int(eval(input()))
problem = [int(eval(input())) for _ in range(N)]
def dsf(i, sum):
if i == N:
if sum % 10 == 0:
return 0
else:
return sum
return max(dsf(i + 1, sum), dsf(i + 1, sum - problem[i]))
if sum(problem) % 10 != 0:
print((sum(problem)))
else:
print((dsf(0, sum(problem)))) | N = int(eval(input()))
problem = [int(eval(input())) for _ in range(N)]
memo = [[-1] * (sum(problem) + 1)] * N
def dsf(i, sum):
if i == N:
if sum % 10 == 0:
return 0
else:
return sum
if memo[i][sum] != -1: return memo[i][sum]
else:
memo[i][sum] = max(dsf(i + 1, sum), dsf(i + 1, sum - problem[i]))
return memo[i][sum]
if sum(problem) % 10 != 0:
print((sum(problem)))
else:
print((dsf(0, sum(problem)))) | p03699 |
N = int(eval(input()))
s = [int(eval(input())) for _ in range(N)]
ans = 0
for i in range(1<<N):
total = 0
for j in range(N):
if (i>>j)&1:
total += s[j]
if total%10 != 0:
ans = max(ans,total)
print(ans) | N = int(eval(input()))
s = [int(eval(input())) for _ in range(N)]
t = [x for x in s if x%10 != 0]
total = sum(s)
if total%10 != 0:
print(total)
else:
if len(t) == 0:
print((0))
else:
print((total-min(t))) | p03699 |
n=int(eval(input()))
s=[]
w=0
m=1000
for i in range(n):
a=int(eval(input()))
s.append(a)
w+=a
if a%10!=0:
m=min(m,a)
if m==1000:
print((0))
elif w%10!=0:
print(w)
else:
print((w-m))
| n=int(eval(input()))
s=[]
l=[]
for i in range(n):
p=int(eval(input()))
s.append(p)
if p%10!=0:
l.append(p)
ans=sum(s)
if ans%10==0:
if l==[]:
print((0))
else:
print((ans-min(l)))
else:
print(ans)
| p03699 |
def score_search(sc, idx):
if idx == len(f):
if sc % 10 == 0:
sc = 0
return sc
sc_lst = [0, 0]
sc_lst[0] = sc + score_search(0, idx+1)
if sc_lst[0] % 10 == 0:
sc_lst[0] = 0
sc += s[f[idx]]
sc_lst[1] = sc + score_search(0, idx+1)
if sc_lst[1] % 10 == 0:
sc_lst[1] = 0
return max(sc_lst)
n = int(eval(input()))
s = [int(eval(input())) for i in range(n)]
f, score = [], 0
for i in range(len(s)):
if s[i] % 10:
f.append(i)
else:
score += s[i]
best_score = score + score_search(0, 0)
if best_score % 10 == 0:
best_score = 0
print(best_score)
| def main():
n = int(eval(input()))
s = [int(eval(input())) for i in range(n)]
sum_max = sum(s)
if sum_max % 10 == 0:
min_p = 101
for i in s:
if i % 10 != 0 and i < min_p:
min_p = i
if min_p == 101:
sum_max = 0
else:
sum_max -= min_p
print(sum_max)
if __name__ == '__main__':
main()
| p03699 |
import itertools
maxnum=0
def parm_check(n,maxnum):
#print(tmp)
#print(list(itertools.combinations(a,n)))
a_sort = sorted(a,reverse=True)
comb = list(itertools.combinations(a_sort,n))
for j in range(len(comb)):
sumnum = sum(comb[j])
if(sumnum % 10 != 0 and maxnum < sumnum):
maxnum = sumnum
break
return maxnum
if(__name__=="__main__"):
N = int(eval(input()))
a =[int(eval(input())) for i in range(N)]
#print(sum(a))
if(sum(a) % 10 != 0):
print((sum(a)))
else:
for i in range(N-1,1,-1):
maxnum = parm_check(i,maxnum)
if(maxnum != 0):
break
print(maxnum)
| maxnum=0
if(__name__=="__main__"):
N = int(eval(input()))
a =[int(eval(input())) for i in range(N)]
#print(sum(a))
if(sum(a) % 10 != 0):
print((sum(a)))
else:
a_sort = sorted(a)
for i in range(0,N):
if(a_sort[i] % 10 != 0):
del a_sort[i]
maxnum = sum(a_sort)
break
print(maxnum) | p03699 |
# https://atcoder.jp/contests/abc063/tasks/arc075_a
import itertools
import collections
import bisect
def main():
N = int(eval(input()))
scores = []
for _ in range(N):
s = int(eval(input()))
scores.append(s)
ans = 0
if sum(scores) % 10 != 0:
ans = sum(scores)
else:
for i in range(1, len(scores)+1):
for cand in itertools.combinations(scores, i):
val = sum(cand)
if val % 10 != 0:
ans = max(ans, val)
print(ans)
if __name__ == '__main__':
main()
| # https://atcoder.jp/contests/abc063/tasks/arc075_a
import itertools
import collections
import bisect
def main():
N = int(eval(input()))
scores = []
for _ in range(N):
s = int(eval(input()))
scores.append(s)
ans = 0
if sum(scores) % 10 != 0:
ans = sum(scores)
else:
scores.sort()
for c in scores:
if c % 10 != 0:
ans = sum(scores) - c
break
print(ans)
if __name__ == '__main__':
main()
| p03699 |
n = int(eval(input()))
s = sorted([int(eval(input())) for i in range(n)])
ans = 0
if sum(s) % 10 != 0:
print((sum(s)))
else:
for i in s:
if i % 10 != 0:
ans = sum(s) - i
print(ans)
break
if ans == 0:
print(ans)
| n = int(eval(input()))
s = sorted([int(eval(input())) for i in range(n)])
total = sum(s)
ans = 0
if total % 10 != 0:
print(total)
else:
for i in s:
if i % 10 != 0:
ans = total - i
break
print((max(0, ans)))
| p03699 |
from itertools import product
N = int(eval(input()))
S = [int(eval(input())) for _ in range(N)]
mmax = 0
for pair in product(list(range(2)), repeat=N):
sum = 0
for i in range(len(pair)):
sum += S[i] * pair[i]
if sum % 10 == 0:
continue
mmax = max(mmax, sum)
print(mmax) | N = int(eval(input()))
S = sorted([int(eval(input())) for _ in range(N)])
m = 0
for s in S:
if s % 10 != 0 and m == 0:
m = s
break
ans = sum(S)
if ans % 10 != 0:
print(ans)
elif m != 0:
print((ans-m))
else:
print((0)) | p03699 |
N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
op_cnt = len(a)
ans = 0
for i in range(2 ** op_cnt):
op = [0] * op_cnt
for j in range(op_cnt):
if ((i >> j) & 1):
op[op_cnt - 1 - j] = a[j]
temp = sum(op)
if sum(op)%10 == 0:
temp = 0
if temp > ans:
ans = temp
print(ans) | N = int(eval(input()))
s1 = []
s2 = []
for i in range(N):
a = int(eval(input()))
if a % 10 != 0:
s1.append(a)
else:
s2.append(a)
if len(s1) == 0:
print((0))
else:
if sum(s1) % 10 == 0:
print((sum(s1)-min(s1)+sum(s2)))
else:
print((sum(s1)+sum(s2))) | p03699 |
from itertools import combinations
n = int(eval(input()))
S = [int(eval(input())) for _ in range(n)]
ans = 0
for i in range(1, n + 1):
for tpl in combinations(S, i):
s = sum(tpl)
if s % 10 != 0:
ans = max(ans, s)
print(ans) | n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
ans = sum(s)
if ans % 10 != 0:
print(ans)
else:
if all([i % 10 == 0 for i in s]):
print((0))
else:
print((ans - min([i for i in s if i % 10 != 0]))) | p03699 |
#063 C Bugged
import sys
n = int(sys.stdin.readline())
S = [int(sys.stdin.readline()) for _ in range(n)]
#print(S)
ans=[]
def saiki(total, i):
if i==n:
#print(total)
ans.append(total)
else:
saiki(total + S[i], i+1)
saiki(total, i+1)
saiki(0, 0)
ans.sort(reverse=True)
for a in ans:
if a%10!=0:
print(a)
break
else:
print((0)) | #063 C Bugged
#動的計画法(DP)で解く
import sys
n = int(sys.stdin.readline())
S = [int(sys.stdin.readline()) for _ in range(n)]
#print(S)
dp =[[0 for _ in range(sum(S)+1)] for _ in range(n)]
dp[0][0]=1
dp[0][S[0]]=1
for i in range(1, n):
for j in range(sum(S)+1):
if dp[i-1][j]==1:
dp[i][j] = 1
dp[i][j+S[i]] = 1
dp[i][S[i]]=1
L=[]
for i, p in enumerate(dp[n-1]):
if p!=0:
L.append(i)
L.sort(reverse=True)
for l in L:
if l%10 !=0:
print(l)
break
else:
print((0)) | p03699 |
def f(scores, d):
if len(scores) == 1:
if scores[0] % 10 == d:
res = 0
else:
res = scores[0]
else:
f1 = scores[0] + f(scores[1:], get_fld(scores[0], d))
if f1 % 10 == d:
f1 = 0
f2 = f(scores[1:], d)
res = max(f1, f2)
return res
def get_fld(score, d):
res = d - score % 10
if res < 0:
res += 10
return res
N = int(eval(input()))
scores = []
for _ in range(N):
scores.append(int(eval(input())))
print((f(scores, 0))) | def f(scores):
res = sum(scores)
if res % 10 == 0:
candidates = list(score for score in scores if score % 10 != 0)
if candidates:
res -= min(candidates)
else:
res = 0
return res
N = int(eval(input()))
scores = []
for _ in range(N):
scores.append(int(eval(input())))
print((f(scores))) | p03699 |
import itertools
n = int(eval(input()))
score = [ int(eval(input())) for _ in range(n)]
cnt = max([sum(c) if sum(c) % 10 != 0 else 0 for i in sorted(range(1, n+1)) for c in itertools.combinations(score, i)])
print(cnt)
| import itertools
n = int(eval(input()))
score = [ int(eval(input())) for _ in range(n)]
cnt = max([sum(c) if sum(c) % 10 != 0 else 0 for i in sorted(range(n-1, n+1)) for c in itertools.combinations(score, i)])
print(cnt)
| p03699 |
N = int(eval(input()))
res = set([0])
for _ in range(N):
s = int(eval(input()))
res |= set([r + s for r in res])
res = list(res)
res.sort()
n = len(res)
for i in range(n-1, -1, -1):
if res[i] % 10 == 0:
continue
print((res[i]))
break
else:
print((0)) | N = int(eval(input()))
S = [int(eval(input())) for _ in range(N)]
S.sort()
total = sum(S)
T = [s for s in S if s % 10 != 0]
if total % 10 != 0:
print(total)
elif len(T) > 0:
print((total - T[0]))
else:
print((0)) | p03699 |
def main():
N = int(eval(input()))
S = []
for _ in range(N):
S.append(int(eval(input())))
maxScore = 0
for i in range(2 ** N):
tmp = 0
for j in range(N):
if ((i >> j) & 1):
tmp = tmp + S[j]
if tmp % 10 == 0:
tmp = 0
if maxScore < tmp:
maxScore = tmp
print(maxScore)
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
S = []
M = []
sumsum = 0
for _ in range(N):
t = int(eval(input()))
if t != 0:
sumsum = sumsum + t
S.append(t)
if t % 10 != 0:
M.append(t)
if sumsum % 10 != 0:
print(sumsum)
return
if len(M) == 0:
print("0")
return
M.sort()
print((sumsum - M[0]))
if __name__ == "__main__":
main() | p03699 |
import itertools
n = int(eval(input()))
s = [int(eval(input())) for s in range(n)]
max0 = 0
for i in range(n):
s2 = list(itertools.permutations(s, i+1))
for comb in s2:
tmax =sum(comb)
if tmax%10 != 0:
max0 = max(max0,sum(comb))
print(max0) | n = int(eval(input()))
s = [int(eval(input())) for s in range(n)]
s1 = []
sum0 = 0
for i in s:
if i%10 == 0:
sum0 += i
else:
s1.append(i)
if len(s1) == 0:
print((0))
else:
sum1 = sum(s1)
if sum1%10 != 0:
print((sum0 + sum1))
else:
print((sum0 + sum1 - min(s1))) | p03699 |
n=int(eval(input()))
score=[]
ans=0
for _ in range(n):
s=int(eval(input()))
score.append(s)
# if score%10==0:
# ans=0
# score=sorted(score,reverse=True)
# for _ in range(n):
# score.pop()
# tmp=sum(score)
# if tmp%10==0:
# tmp=0
# ans=max(ans,tmp)
from itertools import combinations
for m in range(1,n+1):
c=combinations(score,m)
for i in c:
tmp=sum(i)
if tmp%10==0:
tmp=0
ans=max(ans,tmp)
print(ans)
| n=int(eval(input()))
score=[]
for _ in range(n):
s=int(eval(input()))
score.append(s)
#すべて10の倍数ならば0である
non10=[]
flg10=0
for i in range(n):
if score[i]%10!=0:
non10.append(score[i])
flg10=1
if flg10==0:
ans=0
else:
if sum(score)%10==0:
ans=sum(score)-min(non10)
else:
ans=sum(score)
print(ans)
| p03699 |
n = int(eval(input()))
S = []
for i in range(n):
S.append(int(eval(input())))
ans = []
import itertools
for i in itertools.product(list(range(2)), repeat=n):
scr = 0
for j in range(n):
if i[j]:
scr += S[j]
if scr%10 == 0:
scr = 0
ans.append(scr)
print((max(ans))) | n = int(eval(input()))
S = sorted([int(eval(input())) for _ in range(n)])
if sum(S)%10!=0:
print((sum(S)))
exit()
for i in range(n):
if S[i]%10==0:
continue
print((sum(S)-S[i]))
exit()
print((0))
| p03699 |
N = int(eval(input()))
S = []
for _ in range(N):
s = int(eval(input()))
S.append(s)
max = 0
for i in range(s**N):
L = [1]*N
sum = 0
for j in range(N):
if (i>>j)&1:
L[j] = 0
for k in range(N):
if L[k]==1:
sum = sum + S[k]
if max < sum and sum%10!=0:
max = sum
print(max) | N = int(eval(input()))
S = []
for _ in range(N):
s = int(eval(input()))
S.append(s)
max = sum(S)
if max%10!=0:
print(max)
else:
min = float('inf')
for i in range(N):
if S[i]<min and S[i]%10!=0:
min = S[i]
if min==float('inf'):
print((0))
else:
print((max-min))
| p03699 |
n = int(eval(input()))
s = [0] * n
for i in range(n):
s[i] = int(eval(input()))
ans = 0
for i in range(2 ** n):
score = 0
for j in range(n):
if i >> j & 1:
score += s[j]
if score % 10 != 0:
ans = max(ans, score)
print(ans)
| n = int(eval(input()))
s = [0] * n
for i in range(n):
s[i] = int(eval(input()))
ans = sum(s)
if ans % 10 != 0:
print(ans)
else:
s.sort()
for i in range(n):
if s[i] % 10 != 0:
print((ans - s[i]))
exit()
print((0)) | p03699 |
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
dp = [[-1 for _ in range(n*100+1)] for _ in range(n+1)]
dp [0][0] = 0
for i in range(n):
for j in range(n*100+1):
if dp[i][j] != -1:
dp[i+1][j] = dp[i][j]
dp[i+1][j+s[i]] = dp[i][j] + s[i]
res = 0
for i in range(n*100+1)[::-1]:
if dp[n][i] > res and i % 10 != 0:
res = dp[n][i]
break
print(res)
| n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
dp = [[-1 for _ in range(sum(s)+1)] for _ in range(n+1)]
dp [0][0] = 0
for i in range(n):
for j in range(sum(s)+1):
if dp[i][j] != -1:
dp[i+1][j] = dp[i][j]
dp[i+1][j+s[i]] = dp[i][j] + s[i]
res = 0
for i in range(sum(s)+1)[::-1]:
if dp[n][i] > res and i % 10 != 0:
res = dp[n][i]
break
print(res)
| p03699 |
N = int(eval(input()))
s = []
for i in range(N):
s.append(int(eval(input())))
s.sort()
ssum = sum(s)
dp = [[-(10**5) for i in range(ssum+1)] for j in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
for j in range(ssum+1):
if j-s[i-1] >= 0:
dp[i][j] = max(dp[i-1][j],dp[i-1][j-s[i-1]]+s[i-1])
else:
dp[i][j] = dp[i-1][j]
maxa = 0
for j in range(N+1):
for i in range(ssum+1):
if (dp[j][i])%10 == 0:
continue
else:
now = dp[j][i]
maxa = max(maxa,now)
print(maxa) | N = int(eval(input()))
s = []
for i in range(N):
s.append(int(eval(input())))
ssum = sum(s)
dp = [[-(10**5) for i in range(ssum+1)] for j in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
for j in range(ssum+1):
if j-s[i-1] >= 0:
dp[i][j] = max(dp[i-1][j],dp[i-1][j-s[i-1]]+s[i-1])
else:
dp[i][j] = dp[i-1][j]
maxa = 0
for j in range(N+1):
for i in range(ssum+1):
if (dp[j][i])%10 == 0:
continue
else:
now = dp[j][i]
maxa = max(maxa,now)
print(maxa) | p03699 |
N = int(eval(input()))
s = []
for i in range(N):
s.append(int(eval(input())))
ssum = sum(s)
dp = [[-(10**5) for i in range(ssum+1)] for j in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
for j in range(ssum+1):
if j-s[i-1] >= 0:
dp[i][j] = max(dp[i-1][j],dp[i-1][j-s[i-1]]+s[i-1])
else:
dp[i][j] = dp[i-1][j]
maxa = 0
for j in range(N+1):
for i in range(ssum+1):
if (dp[j][i])%10 == 0:
continue
else:
now = dp[j][i]
maxa = max(maxa,now)
print(maxa) | N = int(eval(input()))
s = []
for i in range(N):
s.append(int(eval(input())))
s.sort()
ssum = sum(s)
c = 0
for i in s:
if ssum%10 != 0:
print(ssum)
c = 1
break
if i%10 != 0:
ssum -= i
if c == 0:
print((0)) | p03699 |
n = int(eval(input()))
A = []
for i in range(n):
A.append(int(eval(input())))
import itertools
B = []
for i in range(n+1):
for j in itertools.permutations(A, i):
sum_ = sum(j)
if sum_ % 10 == 0:
B.append(0)
else:
B.append(sum_)
print((max(B))) | n = int(eval(input()))
A = []
for i in range(n):
A.append(int(eval(input())))
total = sum(A)
if total % 10 != 0:
print(total)
else:
A = sorted(A)
for i in range(n):
if A[i] % 10 != 0:
total -=A[i]
break
if total % 10 == 0:
print((0))
else:
print(total) | p03699 |
n = int(eval(input()))
s = [int(eval(input())) for i in range(n)]
ans = []
for i in range(1<<n):
x = 0
for j in range(n):
if (i>>j) & 1:
x += s[j]
if x % 10 == 0:
ans.append(0)
else:
ans.append(x)
print((max(ans))) | n = int(eval(input()))
s = [int(eval(input())) for i in range(n)]
sum_s = sum(s)
if sum_s % 10 != 0:
print(sum_s)
exit()
if all([1 if x % 10 == 0 else 0 for x in s]):
print((0))
else:
for i in range(n):
if s[i] % 10 == 0:
s[i] = 101
s.sort()
ans = sum_s - s[0]
print(ans) | p03699 |
def main():
N = int(eval(input()))
s = [int(eval(input())) for _ in range(N)]
dp = [False] * (10000 + 1)
dp[0] = True
for x in s:
for score in range(10000 - x, -1, -1):
dp[score + x] |= dp[score]
for score in range(10000, -1, -1):
if dp[score] and score % 10 != 0:
print(score)
return
print((0))
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| def main():
N = int(eval(input()))
s = [int(eval(input())) for _ in range(N)]
tot = sum(s)
if tot % 10 == 0:
s.sort()
for x in s:
if x % 10 == 0: continue
tot -= x
break
else:
tot = 0
print(tot)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| p03699 |
def get_sum(n, index, s, slist):
if index == n:
if s % 10 == 0:
s = 0
return s
left = get_sum(n, index + 1, s + slist[index], slist)
right = get_sum(n, index + 1, s, slist)
return max(left, right)
N = int(eval(input()))
sl = []
for n in range(N):
sl.append(int(eval(input())))
sum = 0
index = 0
for s in sorted(sl)[::-1]:
if (sum + s) % 10 == 0:
break
sum += s
index += 1
print((get_sum(N, index, sum, sl))) | N = int(eval(input()))
sl = []
for n in range(N):
sl.append(int(eval(input())))
sum = sum(sl)
sorted_sl = sorted([s for s in sl if s % 10 != 0])
if len(sorted_sl) == 0:
print((0))
exit()
count = 0
while sum % 10 == 0 and count < len(sorted_sl):
sum -= sorted_sl[count]
count += 1
print(sum) | p03699 |
from functools import reduce
import math
def main():
# 文字列の2進数を数値にする
# '101' → '5'
# 文字列の頭に'0b'をつけてint()にわたす
# binary = int('0b'+'101',0)
# 2進数で立っているbitを数える
# 101(0x5) → 2
# cnt_bit = bin(5).count('1')
# N! を求める
# f = math.factorial(N)
# 切り捨て
# 4 // 3
# 切り上げ
#-(-4 // 3)
# 初期値用:十分大きい数(100億)
INF = float("inf")
# 1文字のみを読み込み
# 入力:2
# a = input().rstrip()
# 変数:a='2'
# スペース区切りで標準入力を配列として読み込み
# 入力:2 4 5 7
# a, b, c, d = (int(_) for _ in input().split())
# 変数:a=2 b=4 c=5 d =7
# 1文字ずつ標準入力を配列として読み込み
# 入力:2 4 5 7
# a = list(int(_) for _ in input().split())
# 変数:a = [2, 4, 5, 7]
# 1文字ずつ標準入力を配列として読み込み
# 入力:2457
# a = list(int(_) for _ in input())
# 変数:a = [2, 4, 5, 7]
N = int(input().rstrip())
s = []
for i in range(N):
s.append(int(input().rstrip()))
dp = []
for i in range(N):
dp.append([-1]*(100*100))
dp[0][s[0]] = 1
for i in range(1,N):
for j in range(100*100):
if(j == s[i] or (j-s[i]>=0 and dp[i-1][j-s[i]]==1)):
dp[i][j] = 1
else:
dp[i][j] = dp[i-1][j]
ans = 0
# print('\n'.join(str(_) for _ in(dp[N-1])))
for i in range(100*100-1,0,-1):
if(i%10 != 0 and dp[N-1][i]==1):
ans = i
break
print(ans)
if __name__ == '__main__':
main()
| from functools import reduce
import math
def main():
# 文字列の2進数を数値にする
# '101' → '5'
# 文字列の頭に'0b'をつけてint()にわたす
# binary = int('0b'+'101',0)
# 2進数で立っているbitを数える
# 101(0x5) → 2
# cnt_bit = bin(5).count('1')
# N! を求める
# f = math.factorial(N)
# 切り捨て
# 4 // 3
# 切り上げ
#-(-4 // 3)
# 初期値用:十分大きい数(100億)
INF = float("inf")
# 1文字のみを読み込み
# 入力:2
# a = input().rstrip()
# 変数:a='2'
# スペース区切りで標準入力を配列として読み込み
# 入力:2 4 5 7
# a, b, c, d = (int(_) for _ in input().split())
# 変数:a=2 b=4 c=5 d =7
# 1文字ずつ標準入力を配列として読み込み
# 入力:2 4 5 7
# a = list(int(_) for _ in input().split())
# 変数:a = [2, 4, 5, 7]
# 1文字ずつ標準入力を配列として読み込み
# 入力:2457
# a = list(int(_) for _ in input())
# 変数:a = [2, 4, 5, 7]
N = int(input().rstrip())
s = []
for i in range(N):
s.append(int(input().rstrip()))
s.sort()
ans = 0
if sum(s) % 10 != 0:
ans = sum(s)
print(ans)
exit()
for i in range(N):
if(s[i]%10 !=0 ):
ans = sum(s) - s[i]
break
# dp = []
# for i in range(N):
# dp.append([-1]*(100*100))
# dp[0][s[0]] = 1
# for i in range(1,N):
# for j in range(100*100):
# if(j == s[i] or (j-s[i]>=0 and dp[i-1][j-s[i]]==1)):
# dp[i][j] = 1
# else:
# dp[i][j] = dp[i-1][j]
# ans = 0
# for i in range(100*100-1,0,-1):
# if(i%10 != 0 and dp[N-1][i]==1):
# ans = i
# break
print(ans)
if __name__ == '__main__':
main()
| p03699 |
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
ans = -1
for i in range(2**n):
cnt = 0
for j in range(n):
if i >> j & 1:
cnt += a[j]
if cnt % 10 == 0:
cnt = 0
ans= max(ans, cnt)
print(ans) | n = int(input())
a = [int(input()) for i in range(n)]
a.sort()
ans = sum(a)
if ans % 10 != 0:
print(ans)
exit()
flg = False
for i in range(n):
if a[i] % 10 != 0:
ans -= a[i]
flg = True
break
print(ans) if flg else print(0)
| p03699 |
from itertools import product
N = int(eval(input()))
s = [int(eval(input())) for _ in range(N)]
a = list(product(list(range(2)),repeat = N))
s.sort(reverse=True)
while len(s) >0 and sum(s)%10==0:
s.pop()
print((sum(s))) | N = int(eval(input()))
s = sorted([int(eval(input())) for _ in range(N)])
if sum(s)%10 != 0:
print((sum(s)))
else:
for i in range(N):
if s[i] %10 != 0:
print((sum(s)-s[i]))
exit()
print((0)) | p03699 |
N = int(eval(input()))
S = []
for i in range(N):
S.append(int(eval(input())))
hasFinished = False
ans_cand = []
def dfs(cp, length):
if length == N:
if cp%10 != 0:
print(cp)
exit()
else:
dfs(cp+S[length], length+1)
dfs(cp, length+1)
def ten2zero(num):
if num%10==0:
return 0
else:
return num
def solve(N,S):
S.sort(reverse=True)
s_per5 = [s%10 for s in S]
if sum(s_per5)==0:
print((0))
return
else:
return dfs(0,0)
solve(N,S) | N = int(eval(input()))
S = []
for i in range(N):
S.append(int(eval(input())))
total = sum(S)
if total%10 == 0:
new_S = []
for s in S:
if s%10==0:
new_S.append(101)
else:
new_S.append(s)
if sum(new_S) == 101*len(S):
min_s = total
else:
min_s = min(new_S)
print((total-min_s))
else:
print(total) | p03699 |
from collections import Counter
n = int(eval(input()))
s = []
for _ in range(n):
s.append(int(eval(input())))
cnt = Counter([0, s[0]])
if len(s) > 1:
for si in s[1:]:
tmp = Counter([])
for k,v in list(cnt.items()):
tmp[k + si] = v
cnt += tmp
key_list = sorted(list(cnt.keys()), reverse=True)
for k in key_list:
if k == 0:
print(k)
break
elif k%10 == 0:
continue
print(k)
break | n = int(eval(input()))
s = []
for _ in range(n):
s.append(int(eval(input())))
total = sum(s)
if total % 10 != 0:
print(total)
else:
s.sort()
min_s = total
for si in s:
if si % 10 != 0:
min_s = si
break
print((total - min_s)) | p03699 |
from collections import deque
N = int(eval(input()))
S = []
for _ in range(N):
S.append(int(eval(input())))
Q = deque([(0, 0)])
R = 0
while Q:
i, pt = Q.popleft()
if i == N and pt % 10 != 0:
R = max(pt, R)
if i < N:
Q.append((i + 1, pt + S[i]))
Q.append((i + 1, pt))
print(R)
| from collections import deque
N = int(eval(input()))
S = []
for _ in range(N):
S.append(int(eval(input())))
SA = sum(S)
if SA % 10 == 0:
SS = [s for s in S if s % 10 != 0]
if len(SS) > 0:
SA -= min(SS)
else:
SA = 0
print(SA) | p03699 |
n = int(eval(input()))
A = [int(eval(input())) for i in range(n)]
maxv = 0
def f(q, p):
global maxv
if q == n:
if p % 10 != 0 and p > maxv:
maxv = p
return
f(q + 1, p + A[q])
f(q + 1, p)
f(0, 0)
print(maxv) | n = int(eval(input()))
A = [int(eval(input())) for i in range(n)]
s = sum(A)
if s % 10:
print(s)
else:
A.sort()
for a in A:
if a % 10:
print((s - a))
exit()
else:
print((0)) | p03699 |
def solve():
N = int(eval(input()))
s = [int(eval(input())) for _ in range(N)]
s.sort()
ans = sum(s)
if ans % 10 != 0:
print(ans)
return
mn = float('inf')
for i in range(N):
if s[i] % 10 != 0:
mn = min(mn, s[i])
if mn == float('inf'):
print((0))
else:
ans -= mn
print(ans)
if __name__ == '__main__':
solve() | def solve():
N = int(eval(input()))
s = [int(eval(input())) for _ in range(N)]
sm = sum(s)
dp = [False] * (sm + 1)
dp[0] = True
for val in s:
for i in range(sm, -1, -1):
if dp[i] and i+val <= sm:
dp[i+val] = True
for i in range(sm, -1, -1):
if dp[i] and i % 10 != 0:
print(i)
return
else:
print((0))
if __name__ == '__main__':
solve() | p03699 |
N = int(eval(input()))
S = []
for i in range(N):
S.append(int(eval(input())))
ans = 0
for bits in range(1 << N):
check = 0
for i in range(N):
if (bits >> i & 1) == 1:
check += S[i]
if check % 10 != 0:
ans = max(check,ans)
print(ans) | N = int(eval(input()))
S = []
for i in range(N):
S.append(int(eval(input())))
S = sorted(S)
# print(S)
sum_S = sum(S)
if sum_S % 10 != 0:
print(sum_S)
else:
for i in range(N):
if S[i] % 10 != 0:
sum_S -= S[i]
break
if sum_S % 10 != 0:
print(sum_S)
else:
print((0)) | p03699 |
N = int(eval(input()))
A=[]
for i in range(N):
A.append(int(eval(input())))
B = []
for i in range(2**N):
gokei = 0
for j in range(N):
if ((i >> j) & 1):
gokei += A[j]
B.append(gokei)
B.sort(reverse=True)
for i in B:
if i%10 != 0:
print(i)
break
else:
print((0)) | N = int(eval(input()))
A=[]
for i in range(N):
A.append(int(eval(input())))
A.sort()
gokei = sum(A)
if gokei%10 != 0:
print(gokei)
else:
for i in range(N):
if (gokei - A[i])%10 != 0:
print((gokei - A[i]))
break
else:
print((0)) | p03699 |
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
# total:累計, i:index
def dfs(total, i):
if i == n:
if total % 10 != 0:
return total
else:
return 0
return max(dfs(total, i + 1), dfs(total + s[i], i + 1))
print((dfs(0, 0)))
| n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
total = sum(s)
s.sort()
if total % 10 != 0:
print(total)
else:
for i in range(n):
if (total - s[i]) % 10 != 0:
print((total - s[i]))
exit()
print((0)) | p03699 |
n = int(eval(input()))
s = [int(eval(input())) for i in range(n)]
ans = 0
for i in range(0,2**n):
bits = (bin(i)[2:]).zfill(n)
tmp = sum([j * int(k) for j, k in zip(s, bits)])
ans = max(ans, tmp if tmp % 10 != 0 else 0)
print(ans) | n = int(eval(input()))
s = [int(eval(input())) for i in range(n)]
s.sort()
ans = sum(s)
if (ans % 10 != 0):
print(ans)
else:
for i in s:
if (i % 10 != 0):
print((ans - i))
break
else:
print((0)) | p03699 |
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
s = [int(eval(input())) for i in range(N)]
def dfs(seq):
if len(seq) == N:
score = 0
for i in range(N):
if seq[i] == "1":
score += s[i]
if score % 10 == 0:
return 0
else:
return score
else:
return max(dfs(seq + "0"), dfs(seq + "1"))
print((dfs(""))) | import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
s = [int(eval(input())) for i in range(N)]
wa = sum(s)
s.sort()
if wa % 10 != 0:
print(wa)
else:
for i in range(N):
if s[i] % 10 != 0:
print((wa - s[i]))
break
else:
print((0))
| p03699 |
N = int(eval(input()))
S = sorted([int(eval(input())) for _ in range(N)])
if all([s % 10 == 0 for s in S]):
print((0))
for i in range(1 << N):
s = sum(S)
for j in range(N):
if i & 1 << j:
s -= S[j]
# print(bin(i), s)
if s % 10 != 0:
print(s)
break
| N = int(eval(input()))
S = sorted([int(eval(input())) for _ in range(N)])
s = sum(S)
if s % 10 != 0:
print(s)
exit()
for si in S:
if si % 10 != 0:
print((s - si))
exit()
print((0))
| p03699 |
# C - Bugged
def main():
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s.sort()
if sum(s) % 10 != 0:
print((sum(s)))
else:
for i in range(n):
if s[i] % 10 != 0:
s.pop(i)
print((sum(s)))
exit()
else:
print((0))
if __name__ == "__main__":
main() | # C - Bugged
def main():
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s.sort()
if sum(s) % 10 != 0:
print((sum(s)))
else:
for i in range(n):
if s[i] % 10 != 0:
print((sum(s)-s[i]))
exit()
else:
print((0))
if __name__ == "__main__":
main() | p03699 |
N = int(eval(input()))
src = [int(eval(input())) for i in range(N)]
if all(a%10==0 for a in src):
print((0))
exit()
sm = sum(src)
if sm%10==0:
for a in sorted(src):
if a%10==0: continue
print((sm-a))
exit()
else:
print(sm)
| N = int(eval(input()))
src = [int(eval(input())) for i in range(N)]
sm = sum(src)
if sm%10:
print(sm)
exit()
for a in sorted(src):
if a%10:
print((sm - a))
exit()
else:
print((0)) | p03699 |
import itertools
n = int(eval(input()))
s = list(map(int, [eval(input()) for _ in range(n)]))
ans = []
for i in range(1, n + 1):
for j in itertools.combinations(s, i):
sum_ = sum(j)
if sum_ % 10 == 0:
sum_ = 0
ans.append(sum_)
print((max(ans))) | n = int(eval(input()))
s = list(map(int, [eval(input()) for _ in range(n)]))
if sum(s) % 10 == 0:
while sum(s) % 10 == 0 and len(s) > 0:
s = sorted(s)
i = 0
while s[i] % 10 == 0 and i + 1 < len(s):
i += 1
del s[i]
print((sum(s)))
else:
print((sum(s))) | p03699 |
N = int(eval(input()))
slist = [int(eval(input())) for _ in range(N)]
anslist = []
for bit in range(1<<(N)):
sum = 0
for i in range(N):
if bit & (1<<i):
sum += slist[i]
if sum % 10 != 0:
anslist.append(sum)
if len(anslist) == 0:
print((0))
else:
print((max(anslist))) | import sys
N = int(eval(input()))
slist = [int(eval(input())) for _ in range(N)]
ssum = sum(slist)
if ssum % 10 == 0:
slist.sort()
for s in slist:
if s % 10 != 0:
print((ssum - s))
sys.exit()
print((0))
else:
print(ssum) | p03699 |
import itertools
n = int(eval(input()))
l = [int(eval(input())) for i in range(n)]
combo = [list(itertools.combinations(l, i)) for i in range(1, n+1)]
ans = 0
for i in combo:
for j in i:
temp = sum(list(j))
if temp > ans and not temp % 10 == 0:
ans = temp
print(ans) | n = int(eval(input()))
l = [int(eval(input())) for i in range(n)]
def f():
ans = sum(l)
if ans % 10 == 0:
for i in sorted(l):
if not (ans - i) % 10 == 0:
return ans-i
return 0
else:
return ans
print((f())) | p03699 |
n = int(eval(input()))
l = [int(eval(input())) for i in range(n)]
ans = 0
def f(now, i):
global ans
if not now % 10 == 0 and now > ans:
ans = now
if i >= n:
return
f(now+l[i] ,i+1)
f(now, i+1)
f(0, 0)
print(ans) | n = int(eval(input()))
l = [int(eval(input())) for i in range(n)]
ans = sum(l)
def f():
if not ans % 10 == 0:
return ans
else:
for i in sorted(l):
if not i % 10 == 0:
return ans - i
return 0
print((f())) | p03699 |
N=int(eval(input()))
s=[int(eval(input())) for i in range(N)]
import collections
table=collections.defaultdict(int)
for x in s:
if x%10!=0:
table[x]+=1
if sum(s)%10==0:
if len(table)==0:
print((0))
else:
table=list(table.keys())
table.sort()
print((sum(s) - table[0]))
else:
print((sum(s))) | N = int(eval(input()))
s = [int(eval(input())) for i in range(N)]
S = sum(s)
if S % 10 != 0:
print(S)
else:
s.sort()
ans = S
flag = False
for x in s:
if x % 10 != 0:
ans -= x
flag = True
break
else:
continue
if flag:
print(ans)
else:
print((0))
| p03699 |
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
notten = sorted([i for i in s if i%10])
ten = [i for i in s if i%10==0]
if notten:
for j in range(len(notten)):
if sum(notten[j:])%10:
print((sum(ten)+sum(notten[j:])))
break
else:
print((0)) | n = int(eval(input()))
s = sorted([int(eval(input())) for _ in range(n)])
a = sum(s)
if a %10:
print(a)
exit()
for i in range(n):
b = a - s[i]
if b%10:
print(b)
break
else:
print((0)) | p03699 |
N = int(eval(input()))
S = []
for i in range(N):
S.append(int(eval(input())))
def solve(ind, choice):
# ending
if ind == N:
num = sum(choice)
if num % 10 == 0:
return 0
else:
return sum(choice)
# transition
return max(solve(ind=ind + 1, choice=choice + [S[ind]]), solve(ind=ind + 1, choice=choice))
print((solve(ind=0, choice=[]))) | N = int(eval(input()))
S = []
for i in range(N):
S.append(int(eval(input())))
memo = {}
def solve(ind, points):
# ending
if ind == N:
if points % 10 == 0:
return 0
else:
return points
if memo.get((ind, points)) is not None:
return memo[(ind, points)]
# transition
ret = max(solve(ind=ind + 1, points=points + S[ind]), solve(ind=ind + 1, points=points))
memo[(ind, points)] = ret
return ret
print((solve(ind=0, points=0))) | p03699 |
N = int(eval(input()))
s = [int(eval(input())) for x in range(N)]
fullmax = sum(s)
s_sorted = sorted(s)
cur_max = 0
if fullmax % 10 != 0 :
print(fullmax)
else :
# if everything divisable by zero
div_flg = True
for i in s :
if i % 10 != 0 :
div_flg = False
if div_flg == True :
print("0")
else :
for i in range(N) :
if (fullmax - s_sorted[i]) % 10 != 0 :
cur_max = max(fullmax - s_sorted[i], cur_max)
print(cur_max) | N = int(eval(input()))
s = []
all_10_flg = True
for x in range(N) :
n = int(eval(input()))
s.append(n)
if n % 10 != 0 :
all_10_flg = False
sum_all = sum(s)
if sum_all % 10 != 0 :
print(sum_all)
elif all_10_flg == True :
print("0")
else :
max_sum = 0
for i in s :
if (sum_all - i) % 10 != 0:
max_sum = max(max_sum, sum_all - i)
print(max_sum)
| p03699 |
n = int(eval(input()))
s = [int(eval(input())) for i in range(n)]
ans=0
for i in range(2**len(s)):
x=0
for j in range(n):
if (i>>j)&1:
x+=s[j]
if x%10!=0:
ans=max(ans,x)
print(ans) | n = int(eval(input()))
s = [int(eval(input())) for i in range(n)]
ans=0
m = sum(s)
if m%10==0:
f = True
s.sort()
for si in s:
if si%10!=0:
print((m-si))
f = False
break
if f:
print((0))
else:
print(m) | p03699 |
# C - Bugged
N = int(eval(input()))
S = [int(eval(input())) for _ in range(N)]
lst = []
for i in range(2**N):
ref = 0
for j in range(N):
if 1 & (i >> j):
ref += S[j]
if ref % 10 == 0:
ref = 0
lst.append(ref)
print((max(lst)))
| # C - Bugged
N = int(eval(input()))
S = [int(eval(input())) for _ in range(N)]
S = sorted(S)
ans = sum(S)
if ans % 10 != 0:
pass
else:
for i in range(N):
if S[i] % 10 != 0:
ans = ans - S[i]
break
else:
ans = 0
print(ans)
| p03699 |
N = int(eval(input()))
s = [int(eval(input())) for i in range(N)]
def dfs(i, score):
global ans
if i == N:
if score % 10 != 0:
ans = max(ans, score)
else:
dfs(i+1, score)
dfs(i+1, score+s[i])
ans = 0
dfs(0, 0)
print(ans) | import sys
sys.setrecursionlimit(10**6)
N = int(eval(input()))
s = sorted([int(eval(input())) for i in range(N)])
correct = False
for n in s:
if n % 10 != 0:
correct = True
break
if correct:
ans_max = sum(s)
if ans_max % 10 != 0:
print(ans_max)
else:
for i in s:
if i % 10 != 0:
print((ans_max-i))
break
else:
print((0)) | p03699 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s.sort()
sm = sum(s)
if sm % 10:
ans = sm
else:
ans = 0
for ele in s:
if ele % 10:
ans = sm - ele
break
print(ans)
| n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
sm = sum(s)
if sm % 10:
ans = sm
else:
ans = 0
for e in s:
tmp = sm - e
if tmp % 10:
ans = max(ans, tmp)
print(ans)
| p03699 |
# coding: utf-8
import os
import time
import re
import math
def main():
N=int(eval(input()))
A=[int(eval(input())) for a in range(N)]
#start=time.time();
totalList=[]
for a in range(1<<N):
bit=[]
for b in range(N):
if (a & (1<<b))>0:
bit.insert(0,1)
else:
bit.insert(0,0)
total=0
for b in range(N):
total+=A[b]*bit[b]
totalList.append(total)
totalList.sort(key=lambda x: -x)
ans=0
for a in totalList:
if not a%10==0:
ans=a
break
print(ans)
#print("{}ms".format(math.floor(time.time()*1000-start*1000)))#
main()
| # coding: utf-8
import time
import re
import math
def main():
global N,A,memo
N=int(eval(input()))
A=[int(eval(input())) for a in range(N)]
if sum(A)%10==0:
nm0=[]
for a in A:
if not a%10==0:
nm0.append(a)
if len(nm0)==0:
print((0))
else:
print((sum(A)-min(nm0)))
else:
print((sum(A)))
main() | p03699 |
import itertools
n=int(eval(input()))
d=[]
for i in range(n):
d.append(int(eval(input())))
r=0
for i in range(1,n+1):
for j in list(itertools.combinations(d,i)):
x=sum(j)
if r<x and x%10!=0:
r=x
print(r) | data=[]
for i in range(int(eval(input()))):
data.append(int(eval(input())))
un=[num for num in data if num%10==0]
data=[num for num in data if num%10!=0]
if len(data)==0:
print((0))
else:
if sum(un+data)%10!=0:
print((sum(un+data)))
else:
print((sum(un+data)-min(data))) | p03699 |
# https://atcoder.jp/contests/abc063/tasks/arc075_a
n = int(eval(input()))
nums = []
for _ in range(n):
nums.append(int(eval(input())))
total = sum(nums)
dp = [[False for _ in range(total + 1)] for _ in range(n + 1)]
dp[0][0] = True
for i in range(n):
num = nums[i]
dp[i + 1][num] = True
for j in range(total + 1):
if dp[i][j] and num + j <= total:
dp[i + 1][num + j] = True
dp[i + 1][j] = dp[i][j] or dp[i + 1][j]
for i in range(len(dp[0]))[::-1]:
if dp[-1][i] and i % 10 != 0:
print(i)
break
else:
print((0)) | n = int(eval(input()))
nums = []
for _ in range(n):
nums.append(int(eval(input())))
nums.sort()
ans = sum(nums)
if ans % 10 != 0:
print(ans)
else:
for num in nums:
t = ans - num
if t % 10 != 0:
print(t)
break
else:
print((0)) | p03699 |
# ABC063 C - Bugged
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
L = []
s = sum(A)
for a in A:
if a%10 != 0:
L.append(a)
L.sort()
if not L:
print((0))
else:
if s%10 == 0:
for l in L:
s -= l
if s%10 != 0:
print(s)
exit()
else:
print(s) | n=int(eval(input()))
s=[int(eval(input())) for i in range(n)]
tot=sum(s)
s.sort()
if tot%10!=0:
print(tot)
exit(0)
for ss in s:
if ss%10!=0:
tot-=ss
print(tot)
exit(0)
print((0)) | p03699 |
n = int(eval(input()))
S = sorted([int(eval(input())) for i in range(n)])
if sum(S) % 10 != 0:
print((sum(S)))
else:
S = S + [-1]
for i in range(n + 1):
if S[i] == -1:
print((0))
elif S[i] % 10 != 0:
del S[i]
print((sum(S) + 1))
break | N = int(eval(input()))
S = [int(eval(input())) for i in range(N)]
sumS = sum(S)
sortS = sorted(S)
if sumS % 10 != 0:
ans = sumS
else:
for i in range(N):
if sortS[i] % 10 != 0:
ans = sumS - sortS[i]
break
else:
ans = 0
print(ans) | p03699 |
from sys import stdin
from itertools import accumulate
from itertools import permutations
n = int(stdin.readline().rstrip())
li = [int(stdin.readline().rstrip()) for _ in range(n)]
lin = list(permutations(li))
ma = 0
for i in lin:
i = list(i)
lis = list(accumulate(i))[::-1]
for i in lis:
if i % 10 == 0:
continue
ma = max(ma,i)
print(ma) | from sys import stdin
from itertools import accumulate
n = int(stdin.readline().rstrip())
li = [int(stdin.readline().rstrip()) for _ in range(n)]
li.sort()
lin = list(accumulate(li))
if lin[-1] %10 != 0:
print((lin[-1]))
exit()
else:
for i in li:
if i % 10 == 0:
continue
print((lin[-1]-i))
exit()
print((0))
| p03699 |
n = int(eval(input()))
li = [int(eval(input())) for _ in range(n)]
li.sort(reverse=True)
point = sum(li)
while True:
if point % 10 != 0:
print(point)
break
if not li:
print((0))
break
a = li.pop()
point = point-a
if point%10 == 0:
point += a | n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s.sort()
point = sum(s)
if point%10 == 0:
for i in s:
if i%10 != 0:
point -= i
break
if point%10 == 0:
print((0))
else:
print(point) | p03699 |
from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
# from operator import xor
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
def resolve():
N=int(eval(input()))
S=[int(eval(input())) for i in range(N)]
ls=[]
for i in range(1, N + 1):
for j in combinations(S,i):
ls.append(j)
ans=0
for i in ls:
if sum(i)%10!=0:
ans=max(ans,sum(i))
print(ans)
resolve() | from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
# from operator import xor
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
def resolve():
N=int(eval(input()))
S=[int(eval(input())) for i in range(N)]
ls=[]
for i in range(1, N + 1):
for j in combinations(S,i):
val=sum(j)
if val%10!=0:
ls.append(val)
print((max(ls,default=0)))
resolve() | p03699 |
from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
# from operator import xor
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
def resolve():
N=int(eval(input()))
S=[int(eval(input())) for i in range(N)]
ls=[]
for i in range(1, N + 1):
for j in combinations(S,i):
val=sum(j)
if val%10!=0:
ls.append(val)
print((max(ls,default=0)))
resolve() | def resolve():
N=int(eval(input()))
S=sorted([int(eval(input())) for i in range(N)])
total=sum(S)
if total%10!=0:
print(total)
else:
for i in range(N):
if S[i]%10!=0:
print((total-S[i]))
break
elif i==N-1:print((0))
resolve() | p03699 |
import sys
input = sys.stdin.buffer.readline
n = int(eval(input()))
S = []
for _ in range(n):
S.append(int(eval(input())))
ans = 0
for i in range(1 << n):
temp = 0
for j in range(n):
if (i >> j) & 1:
temp += S[j]
if temp % 10 == 0:
temp = 0
ans = max(temp, ans)
print(ans)
| import sys
input = sys.stdin.buffer.readline
n = int(eval(input()))
S = []
for _ in range(n):
S.append(int(eval(input())))
S.sort()
goukei = sum(S)
if goukei %10!=0:
print(goukei)
exit()
ans = 0
for i in range(n):
temp = goukei - S[i]
if temp % 10 == 0:
temp = 0
ans = max(ans, temp)
print(ans)
| p03699 |
ans = float("inf")
def solve():
N, K = list(map(int, input().split()))
if N % K:
print((1))
else:
print((0))
if __name__ == "__main__":
solve()
| N, K = list(map(int, input().split()))
print((0 if N % K == 0 else 1))
| p03284 |
print((int(eval(input().replace(' ','%'))!=0))) | print(((eval(input().replace(' ','%'))>0)+0)) | p03284 |
a,b = list(map(int,input().split()))
if a % b == 0:
print('0')
else:
print('1') | n,k = list(map(int,input().split()))
if n%k == 0:
print((0))
else:
print((1)) | p03284 |
N, K = list(map(int, input().split()))
print((0 if N % K == 0 else 1))
| N, K = list(map(int, input().split()))
print((min(N % K, 1)))
| p03284 |
n, k = list(map(int, input().split()))
if n%k > 0:
print((1))
else:
print((0))
| n, k = list(map(int, input().split()))
if n%k == 0:
print((0))
else:
print((1)) | p03284 |
n, k = list(map(int, input().split()))
if n % k == 0:
print((0))
else:
print((1)) | n, k = list(map(int, input().split()))
print((0 if n % k == 0 else 1)) | p03284 |
print((int(eval(input().replace(" ","%"))!=0))) | print(((eval(input().replace(" ","%"))>0)+0)) | p03284 |
n,k=list(map(int,input().split()))
print((1 if n%k else 0)) | N, K = list(map(int, input().split()))
print((int(N%K != 0)))
| p03284 |
N, K = list(map(int, input().split() ))
if N%K == 0:
print((0))
else:
print((1)) | n, k = list(map(int, input().split()))
if n%k == 0:
print("0")
else:
print("1") | p03284 |
import sys
rm = lambda: list(map(int, sys.stdin.buffer.readline().split()))
n, k = rm()
print((0 if n%k == 0 else 1))
| import sys
rm = lambda: list(map(int, sys.stdin.readline().split()))
n, k = rm()
print((0 if n%k == 0 else 1))
| p03284 |
N, K = [int(i) for i in input().split()]
tmp = [0] * K
while True:
for i in range(K):
tmp[i] += 1
N -= 1
if N == 0:
break
if N == 0:
break
print((max(tmp) - min(tmp))) | N, K = [int(i) for i in input().split()]
print((0 if N % K == 0 else 1)) | p03284 |
class WeightedUnionFind:
def __init__(self, n):
self.n = n
self.nodes = [i for i in range(n)]
self.weights = [0 for _ in range(n)]
def connected(self, i, j):
ri = self.root(i)
rj = self.root(j)
return ri == rj
def union(self, i, j, w):
ri = self.root(i)
rj = self.root(j)
if ri != rj:
assert self.weights[ri] == 0
assert self.weights[rj] == 0
wi = self.weight(i, ri)
wj = self.weight(j, rj)
self.nodes[ri] = rj
self.weights[ri] = wj - wi + w
else:
assert self.weight(i, ri) - self.weight(j, ri) == w
def weight(self, i, j):
ri = self.root(i)
rj = self.root(j)
if ri != rj:
raise ValueError('{} and {} is not connected'.format(i, j))
wi, wj = 0, 0
while i != ri:
wi += self.weights[i]
i = self.nodes[i]
while j != rj:
wj += self.weights[j]
j = self.nodes[j]
return wi - wj
def root(self, i):
ri = self.nodes[i]
while ri != self.nodes[ri]:
ri = self.nodes[ri]
return ri
def run():
n, q = [int(i) for i in input().split()]
wuf = WeightedUnionFind(n)
for _ in range(q):
com, *args = input().split()
if com == '0':
wuf.union(*[int(i) for i in args])
elif com == '1':
x, y = [int(i) for i in args]
if wuf.connected(x, y):
print((wuf.weight(x, y)))
else:
print('?')
if __name__ == '__main__':
run()
| #!/usr/bin/env python3
# DSL_1_B: Weighted Union Find Trees
class WeightedUnionFind:
def __init__(self, n):
self.n = n
self.nodes = [i for i in range(n)]
self.weights = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def connected(self, i, j):
wi, ri = self.root(i)
wj, rj = self.root(j)
return ri == rj
def union(self, i, j, w):
wi, ri = self.root(i)
wj, rj = self.root(j)
if ri == rj:
return
if self.size[ri] < self.size[rj]:
self.nodes[ri] = rj
self.weights[ri] = wj - wi + w
self.size[rj] += self.size[ri]
else:
self.nodes[rj] = ri
self.weights[rj] = wi - wj - w
self.size[ri] += self.size[rj]
def weight(self, i, j):
wi, ri = self.root(i)
wj, rj = self.root(j)
if ri != rj:
raise ValueError('{} and {} is not connected'.format(i, j))
return wi - wj
def root(self, i):
r = self.nodes[i]
w = self.weights[i]
while r != self.nodes[r]:
w += self.weights[r]
r = self.nodes[r]
return w, r
def run():
n, q = [int(i) for i in input().split()]
wuf = WeightedUnionFind(n)
for _ in range(q):
com, *args = input().split()
if com == '0':
wuf.union(*[int(i) for i in args])
elif com == '1':
x, y = [int(i) for i in args]
if wuf.connected(x, y):
print((wuf.weight(x, y)))
else:
print('?')
if __name__ == '__main__':
run()
| p02344 |
import sys
sys.setrecursionlimit(10000)
def simplefindset(x,element,resultPos=0):
if(x != element[x]):
resultPos = simplefindset(element[x],element,resultPos)
else:
resultPos = x
return resultPos
def findset(x,element,weight,resultPos=0,sumW=0):
if(x != element[x]):
resultPos,sumW = findset(element[x],element,weight,resultPos,sumW)
else:
resultPos = x
sumW += weight[x]
return resultPos,sumW
def union(x,y,element,weight,w):
x,wx = findset(x,element,weight)
y,wy = findset(y,element,weight)
link(x,wx,y,wy,w,element)
def link(x,wx,y,wy,z,element):
z = z+wy-wx
element[x] = y
weight[x] = z
n,q = list(map(int, input().split()));
element = [i for i in range(n)]
weight = [0 for i in range(n)]
for i in range(q):
inp = list(map(int, input().split()));
inp = list(inp)
if(inp[0] == 0):
x,y,w = inp[1],inp[2],inp[3]
union(x,y,element,weight,w)
else:
x,y = inp[1],inp[2]
if(simplefindset(x,element) == simplefindset(y,element)):
x,wx = findset(x,element,weight)
y,wy = findset(y,element,weight)
print((wx-wy))
else:
print('?')
| import sys
sys.setrecursionlimit(10000)
def findset(x,element,weight,resultPos=0,sumW=0):
if(x != element[x]):
resultPos,sumW = findset(element[x],element,weight,resultPos,sumW)
sumW += weight[x]
else:
resultPos = x
return resultPos,sumW
def union(x,y,element,weight,w):
x,wx = findset(x,element,weight)
y,wy = findset(y,element,weight)
link(x,wx,y,wy,w,element)
def link(x,wx,y,wy,z,element):
z = z+wy-wx
element[x] = y
weight[x] = z
n,q = list(map(int, input().split()));
element = [i for i in range(n)]
weight = [0 for i in range(n)]
for i in range(q):
inp = list(map(int, input().split()));
inp = list(inp)
if(inp[0] == 0):
x,y,w = inp[1],inp[2],inp[3]
union(x,y,element,weight,w)
else:
x,y = inp[1],inp[2]
x,wx = findset(x,element,weight)
y,wy = findset(y,element,weight)
if(x == y):
print((wx-wy))
else:
print('?')
| p02344 |
n = int(eval(input()))
arr = list(map(int, input().split()))
arr = tuple(sorted(enumerate(arr), key=lambda tpl: -tpl[1]))
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i, (p, a) in enumerate(arr):
for l in range(i + 1):
dp[i + 1][l] = max(dp[i + 1][l], dp[i][l] + a * abs(p - (n - (i - l) - 1)))
dp[i + 1][l + 1] = max(dp[i + 1][l + 1], dp[i][l] + a * abs(p - l))
print((max(dp[n])))
|
def main():
n = int(eval(input()))
arr = list(map(int, input().split()))
arr = tuple(sorted(enumerate(arr), key=lambda tpl: -tpl[1]))
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i, (p, a) in enumerate(arr):
for l in range(i + 1):
dp[i + 1][l] = max(dp[i + 1][l], dp[i][l] + a * abs(p - (n - (i - l) - 1)))
dp[i + 1][l + 1] = max(dp[i + 1][l + 1], dp[i][l] + a * abs(p - l))
print((max(dp[n])))
main()
| p02709 |
import sys
sys.setrecursionlimit(10 ** 9)
n = int(eval(input()))
a = list(map(int,input().split()))
b = []
for i in range(n):
b.append((a[i],i))
b.sort(reverse = True)
ans = 0
def f(l,r,i,h):
global ans
if i == n:
ans = max(ans,h)
return
x = b[i][0]
y = b[i][1]
f(l+1,r,i+1,h+x*abs(y-l))
f(l,r-1,i+1,h+x*abs(y-r))
f(0,n-1,0,0)
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
b = []
for i in range(n):
b.append((a[i],i))
b.sort(reverse = True)
dp = [[0 for _ in range(n+1)] for _ in range(n+1)]
for i in range(n):
x = b[i][0]
y = b[i][1]
for l in range(i+1):
r = i-l
dp[i+1][l+1] = max(dp[i+1][l+1],dp[i][l]+x*(y-l))
dp[i+1][l] = max(dp[i+1][l],dp[i][l]+x*(n-1-r-y))
ans = 0
for i in range(n+1):
ans = max(dp[n][i],ans)
print(ans)
#print(dp) | p02709 |
N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted([(a, i) for i, a in enumerate(A)], reverse=True)
dp = [0] * (N + 1)
for i in range(N):
dp2 = dp[:]
for l in range(i + 1):
a, pos = A[i]
# add left side
dp2[l + 1] = max(dp2[l + 1], dp[l] + (pos - l) * a)
# add right side
r = i - l + 1
dp2[l] = max(dp2[l], dp[l] + (N - r - pos) * a)
dp = dp2
print((max(dp))) | N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted([(a, i) for i, a in enumerate(A)], reverse=True)
dp = [0] * (N + 1)
for i in range(N):
dp2 = dp[:]
for l in range(i + 1):
a, pos = A[i]
# add left side
dp2[l + 1] = max(dp2[l + 1], dp[l] + abs(pos - l) * a)
# add right side
r = i - l + 1
dp2[l] = max(dp2[l], dp[l] + abs(N - r - pos) * a)
dp = dp2
print((max(dp))) | p02709 |
n = int(eval(input()))
A_l = [(A,i) for i, A in enumerate(map(int,input().split()))]
A_l.sort()
A_l.reverse()
dp = []
for _ in range(n+1):
dp.append([0] * (n+1))
for j in range(1,n+1): # all go bigger
yb = n - (j-1)
x = A_l[j-1][1] + 1
# if yb-i <0:
# dp[j][0] = -float('inf')
# else:
dp[j][0] = dp[j-1][0] + A_l[j-1][0]*(yb-x)
for k in range(1,n+1): # all go smaller
ys = 1 + (k-1)
x = A_l[k-1][1] + 1
# if i-ys <0:
# dp[0][k] = -float('inf')
# else:
dp[0][k] = dp[0][k-1] + A_l[k-1][0]*(x-ys)
for j in range(1,n+1):
for k in range(1,n-j+1):
yb = n - (j-1)
ys = 1 + (k-1)
x = A_l[j+k-1][1] + 1
j_plus = A_l[j+k-1][0]*(yb-x)
k_plus = A_l[j+k-1][0]*(x-ys)
if j_plus <0:
j_plus = -float('inf')
elif k_plus <0:
k_plus = -float('inf')
dp[j][k] = max(dp[j-1][k]+j_plus, dp[j][k-1]+k_plus)
result = 0
for j in range(0,n+1):
k = n-j
result = max(result, dp[j][k])
print(result)
#for l in range(n+1):
# print(dp[l]) | n = int(eval(input()))
A_l = [(A,i) for i, A in enumerate(map(int,input().split()))]
A_l.sort()
A_l.reverse()
dp = []
for _ in range(n+1):
dp.append([0] * (n+1))
for j in range(1,n+1): # all go bigger
yb = n - (j-1)
a, i = A_l[j-1]
dp[j][0] = dp[j-1][0] + a*(yb-(i+1))
for k in range(1,n+1): # all go smaller
ys = 1 + (k-1)
a, i = A_l[k-1]
dp[0][k] = dp[0][k-1] + a*((i+1)-ys)
for j in range(1,n+1):
for k in range(1,n-j+1):
yb = n - (j-1)
ys = 1 + (k-1)
a, i = A_l[j+k-1]
j_plus = a*(yb-(i+1))
k_plus = a*((i+1)-ys)
dp[j][k] = max(dp[j-1][k]+j_plus, dp[j][k-1]+k_plus)
result = 0
for j in range(0,n+1):
k = n-j
result = max(result, dp[j][k])
print(result)
#for l in range(n+1):
# print(dp[l]) | p02709 |
n = int(eval(input()))
A_l = [(A,i) for i, A in enumerate(map(int,input().split()))]
A_l.sort()
A_l.reverse()
dp = []
for _ in range(n+1):
dp.append([0] * (n+1))
for j in range(1,n+1): # all go bigger
yb = n - (j-1)
a, i = A_l[j-1]
dp[j][0] = dp[j-1][0] + a*(yb-(i+1))
for k in range(1,n+1): # all go smaller
ys = 1 + (k-1)
a, i = A_l[k-1]
dp[0][k] = dp[0][k-1] + a*((i+1)-ys)
for j in range(1,n+1):
for k in range(1,n-j+1):
yb = n - (j-1)
ys = 1 + (k-1)
a, i = A_l[j+k-1]
j_plus = a*(yb-(i+1))
k_plus = a*((i+1)-ys)
dp[j][k] = max(dp[j-1][k]+j_plus, dp[j][k-1]+k_plus)
result = 0
for j in range(0,n+1):
k = n-j
result = max(result, dp[j][k])
print(result)
#for l in range(n+1):
# print(dp[l]) | n = int(eval(input()))
A_l = [(A,i) for i, A in enumerate(map(int,input().split()))]
A_l.sort(reverse=True)
dp = []
for _ in range(n+1):
dp.append([0] * (n+1))
for j in range(1,n+1): # all go bigger
a, i = A_l[j-1]
dp[j][0] = dp[j-1][0] + a*(n-(j-1) - (i+1))
for k in range(1,n+1): # all go smaller
a, i = A_l[k-1]
dp[0][k] = dp[0][k-1] + a*((i+1) - (1+(k-1)))
for j in range(1,n+1):
for k in range(1,n-j+1):
a, i = A_l[j+k-1]
j_plus = a*(n-(j-1) - (i+1))
k_plus = a*((i+1) - (1+(k-1)))
dp[j][k] = max(dp[j-1][k]+j_plus, dp[j][k-1]+k_plus)
result = 0
for j in range(0,n+1):
k = n-j
result = max(result, dp[j][k])
print(result)
#for l in range(n+1):
# print(dp[l]) | p02709 |
# coding: utf-8
N = int(eval(input()))
_A = sorted(enumerate(map(int, input().split()), 1), key=lambda x:x[1], reverse=True)
dp = [[0 for _ in range(N+1)] for i in range(N+1)]
for i in range(1,N+1):
k, Ak = _A[i-1]
if (N-i-k) < 0:break
dp[0][i] = dp[0][i-1] + (N-i+1-k) * Ak
for i in range(1,N+1):
k, Ak = _A[i-1]
if (k-i) < 0:break
dp[i][0] = dp[i-1][0] + (k-i) * Ak
for x in range(1, N+1):
for y in range(1, N-x+1):
k, val = _A[x+y-1]
dp[x][y]= max((k-x >= 0)*(dp[x-1][y] + (k-x)*val),
(N-y-k+1 >= 0)*(dp[x][y-1] + (N-y-k+1) * val))
print((int(max(dp[i][N-i] for i in range(N+1)))))
| # coding: utf-8
N = int(eval(input()))
_A = sorted(enumerate(map(int, input().split()), 1), key=lambda x:x[1], reverse=True)
dp = [[0] * (N+1) for i in range(N+1)]
for i in range(1,N+1):
k, Ak = _A[i-1]
if (N-i-k) < 0:break
dp[0][i] = dp[0][i-1] + (N-i+1-k) * Ak
for i in range(1,N+1):
k, Ak = _A[i-1]
if (k-i) < 0:break
dp[i][0] = dp[i-1][0] + (k-i) * Ak
for x in range(1, N+1):
for y in range(1, N-x+1):
k, val = _A[x+y-1]
dp[x][y]= max(dp[x-1][y] + abs(k-x)*val,
dp[x][y-1] + abs(N-y-k+1) * val)
print((int(max(dp[i][N-i] for i in range(N+1)))))
| p02709 |
'''
着想：大きいaほど左右の端に移動したい、小さいaを先に端にやるより必ず大きくなるから
問題：単純に貪欲に大きいaから左端(x-1)と右端(N-x)の大きい方に移動すると、
残りのaの組み合わせ的に最適でない場合がある
アイテムの左右端の単純な割り振りはO(2^N)
解決策の着想：大きい順のk個を(k=L+R)となる
左L個右R個にどのように割り振っても(k+1)個目の最適な割り振り方は変わらない
解決策：アイテムk個左右に割り振る状態をdp[L][R]で保存O(N^2)
'''
N = int(eval(input()))
A = [[a, i] for a,i in zip(list(map(int, input().split())), list(range(N)))]
A.sort(key=lambda a: a[0], reverse=True)
dp = [[0]*(N+1) for _ in range(N+1)] # 左からxマス右からyマス埋める
for i in range(0,N):
a, l = A[i]
for x in range(0,i+1):
y = i - x # 合計x+y=iマス既に埋まっている、次にi+1マス目を考える
dp[x+1][y] = max(dp[x+1][y], dp[x][y] + a * abs(l - x))
dp[x][y+1] = max(dp[x][y+1], dp[x][y] + a * abs(l - (N-y-1)))
print((max(dp[N-i][i] for i in range(N+1)))) | '''
着想：大きいaほど左右の端に移動したい、小さいaを先に端にやるより必ず大きくなるから
問題：単純に貪欲に大きいaから左端(x-1)と右端(N-x)の大きい方に移動すると、
残りのaの組み合わせ的に最適でない場合がある
アイテムの左右端の単純な割り振りはO(2^N)
解決策の着想：大きい順のk個を(k=L+R)となる
左L個右R個にどのように割り振っても(k+1)個目の最適な割り振り方は変わらない
解決策：アイテムk個左右に割り振る状態をdp[L][R]で保存O(N^2)
'''
def solve():
N = int(eval(input()))
A = [[a, i] for a,i in zip(list(map(int, input().split())), list(range(N)))]
A.sort(key=lambda a: a[0], reverse=True)
dp = [[0]*(N+1) for _ in range(N+1)] # 左からxマス右からyマス埋める
for i in range(0,N):
a, l = A[i]
for x in range(0,i+1):
y = i - x # 合計x+y=iマス既に埋まっている、次にi+1マス目を考える
dp[x+1][y] = max(dp[x+1][y], dp[x][y] + a * abs(l - x))
dp[x][y+1] = max(dp[x][y+1], dp[x][y] + a * abs(l - (N-y-1)))
print((max(dp[N-i][i] for i in range(N+1))))
solve() | p02709 |
N = int(eval(input()))
A = list(map(int, input().split()))
A = list(enumerate(A, start=1))
A.sort(reverse=True, key=lambda x: x[1])
dp = [[0]*(N + 1) for _ in range(N + 1)]
for j in range(N):
dp[0][j+1] = dp[0][j] + A[j][1]*((N - j) - A[j][0])
for i in range(N):
dp[i+1][0] = dp[i][0] + A[i][1]*(A[i][0] - (i + 1))
for j in range(N - i - 1):
dp[i+1][j+1] = max(dp[i+1][j] + A[i+j+1][1]*((N - j) - A[i+j+1][0]),
dp[i][j+1] + A[i+j+1][1]*(A[i+j+1][0] - (i + 1)))
print((max(dp[i][N-i] for i in range(N+1))))
| N = int(eval(input()))
A = list(map(int, input().split()))
p = list(range(N))
p.sort(key=lambda i: A[i], reverse=True)
dp = [[0]*(N + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(i + 1):
pi = p[i]
dp[i+1][j] = max(dp[i+1][j], dp[i][j] + A[pi]*(N - i + j - 1 - pi))
dp[i+1][j+1] = dp[i][j] + A[pi]*(pi - j)
print((max(dp[N])))
| p02709 |
#def solve():
INF = float('inf')
def max2(x, y): return x if x >= y else y
N = int(eval(input()))
As = [(A, i) for i, A in enumerate(map(int, input().split()))]
As.sort(reverse=True)
dp = [[-INF]*(N+1) for _ in range(N+1)]
dp[0][0] = 0
for no, (A, pos) in enumerate(As):
for i in range(no+1):
j = no-i
dp[i+1][j] = max2(dp[i+1][j], dp[i][j] + A*abs(pos-i))
dp[i][j+1] = max2(dp[i][j+1], dp[i][j] + A*abs(pos-(N-1-j)))
ans = 0
for i in range(N+1):
j = N-i
ans = max2(ans, dp[i][j])
print(ans)
#solve() | def solve():
INF = float('inf')
def max2(x, y): return x if x >= y else y
N = int(eval(input()))
As = [(A, i) for i, A in enumerate(map(int, input().split()))]
As.sort(reverse=True)
dp = [[-INF]*(N+1) for _ in range(N+1)]
dp[0][0] = 0
for no, (A, pos) in enumerate(As):
for i in range(no+1):
j = no-i
dp[i+1][j] = max2(dp[i+1][j], dp[i][j] + A*abs(pos-i))
dp[i][j+1] = max2(dp[i][j+1], dp[i][j] + A*abs(pos-(N-1-j)))
ans = 0
for i in range(N+1):
j = N-i
ans = max2(ans, dp[i][j])
print(ans)
solve() | p02709 |
import heapq
n = int(eval(input()))
a = list(map(int,input().split()))
hq = []
for i, ai in enumerate(a):
heapq.heappush(hq,(-ai,i))
dp = [[-1 for i in range(n+1)] for j in range(n+1)]
dp[0][0] = 0
ai,hi = heapq.heappop(hq)
dp[1][0] = -ai*hi
dp[0][1] = -ai*(n-1-hi)
for i in range(2,n+1):
ai,hi = heapq.heappop(hq)
dp[i][0] = dp[i-1][0] - ai*abs(hi-i+1)
dp[0][i] = dp[0][i-1] - ai*abs(n-i-hi)
for j in range(1,i):
dp[i-j][j] = max(dp[i-j-1][j]-ai*abs(hi-i+j+1),dp[i-j][j-1]-ai*abs(n-j-hi))
max = 0
for i in range(n+1):
if max < dp[i][n-i]:
max = dp[i][n-i]
print(max)
| import heapq
import time
st = time.time()
n = int(eval(input()))
a = list(map(int,input().split()))
hq = []
for i, ai in enumerate(a):
heapq.heappush(hq,(-ai,i))
dp = [[0 for i in range(j+1)] for j in range(n+1)]
dp[0][0] = 0
ai,hi = heapq.heappop(hq)
dp[1][0] = -ai*(n-1-hi)
dp[1][1] = -ai*hi
for i in range(2,n+1):
ai,hi = heapq.heappop(hq)
dp[i][0] = dp[i-1][0] - ai*abs(n-i-hi)
dp[i][i] = dp[i-1][i-1] - ai*abs(hi-i+1)
for j in range(1,i):
dp[i][j] = max(dp[i-1][j-1]-ai*abs(hi-j+1),dp[i-1][j]-ai*abs(n-i+j-hi))
print((max(dp[n])))
| p02709 |
import sys
sys.setrecursionlimit(10 ** 9)
N = int(eval(input()))
infants = []
for i, A in enumerate(map(int, input().split(' '))):
infants.append((-A, i + 1))
infants.sort()
dp = [{} for _ in range(N)]
def search(i, l):
# i番目の幼児を見ていて左にl人配置している
if i == N:
return 0
if l in dp[i]:
return dp[i][l]
(act_val, pos) = infants[i]
act_val = -act_val
ans = max(search(i + 1, l + 1) + abs(l + 1 - pos) * act_val,
search(i + 1, l) + abs(N - i + l - pos) * act_val)
dp[i][l] = ans
return ans
print((search(0, 0))) | import sys
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
infants = []
for i, A in enumerate(map(int, input().split(' '))):
infants.append((-A, i + 1))
infants.sort()
dp = [[-1 for _ in range(N + 1)] for _ in range(N + 1)]
def search(i, l):
# i番目の幼児を見ていて左にl人配置している
if i == N:
return 0
if dp[i][l] != -1:
return dp[i][l]
(act_val, pos) = infants[i]
act_val = -act_val
ans = max(search(i + 1, l + 1) + abs(l + 1 - pos) * act_val,
search(i + 1, l) + abs(N - i + l - pos) * act_val)
dp[i][l] = ans
return ans
print((search(0, 0))) | p02709 |
def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
B = [(A[i], i) for i in range(N)]
B.sort(key = lambda x: x[0], reverse = True)
DP = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(N):
a = B[i][0]
tmp = B[i][1]
for x in range(i + 1):
DP[x + 1][i - x] = max(DP[x + 1][i - x], DP[x][i - x] + a * abs(tmp - x))
DP[x][i - x + 1] = max(DP[x][i - x + 1], DP[x][i - x] + a * abs((N - tmp - 1) - (i - x)))
ans = 0
for i in range(N + 1):
ans = max(ans, DP[i][N - i])
print (ans)
# for tmp in DP:
# print (tmp)
if __name__ == '__main__':
main() | def main():
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
B = [(A[i], i) for i in range(N)]
B.sort(key = lambda x: x[0], reverse = True)
DP = [[0] * (N + 1) for _ in range(N + 1)]
for i, b in enumerate(B):
a = b[0]
tmp = b[1]
for x in range(i + 1):
DP[x + 1][i - x] = max(DP[x + 1][i - x], DP[x][i - x] + a * abs(tmp - x))
DP[x][i - x + 1] = max(DP[x][i - x + 1], DP[x][i - x] + a * abs((N - tmp - 1) - (i - x)))
ans = 0
for i in range(N + 1):
ans = max(ans, DP[i][N - i])
print (ans)
# for tmp in DP:
# print (tmp)
if __name__ == '__main__':
main() | p02709 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.