input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
limit = 10 ** 5 * 2
sys.setrecursionlimit(limit)
def calc_depth(n):
if children[n] == set():
return 0
depth_l = [calc_depth(child) for child in children[n]]
depth_l.sort(reverse=True)
return max(depth + (i+1) for (i, depth) in enumerate(depth_l))
N = int(eval(input(... | from sys import stdin, setrecursionlimit
setrecursionlimit(10**7)
def solve():
N = int(stdin.readline())
Adj = [[] for i in range(N)]
for i in range(N - 1):
a = int(stdin.readline()) - 1
Adj[a].append(i + 1)
ans = dfs(N, Adj, 0, -1)
print(ans)
def dfs(N, Adj, v,... | p03822 |
import sys
sys.setrecursionlimit(10**5)
from collections import defaultdict
n = int(eval(input()))
e = [[] for i in range(n)]
for i in range(1,n):
x = int(eval(input()))
e[x-1].append(i)
num = {}
def dfs(x):
if x in num:
return num[x]
count = len(e[x])
if count == 0:
... | import sys
sys.setrecursionlimit(10**5)
from collections import defaultdict
n = int(eval(input()))
e = [[] for i in range(n)]
for i in range(1,n):
x = int(eval(input()))
e[x-1].append(i)
def dfs(x):
count = len(e[x])
if count == 0:
return 0
d = defaultdict(int)
ma = 0
... | p03822 |
import sys
sys.setrecursionlimit(10**5)
from collections import defaultdict
n = int(eval(input()))
e = [[] for i in range(n)]
for i in range(1,n):
x = int(eval(input()))
e[x-1].append(i)
def dfs(x):
count = len(e[x])
if count == 0:
return 0
d = defaultdict(int)
ma = 0
... | import sys
sys.setrecursionlimit(10**5)
n = int(eval(input()))
e = [[] for i in range(n)]
for i in range(1,n):
x = int(eval(input()))
e[x-1].append(i)
def dfs(x):
count = len(e[x])
if count == 0:
return 0
l = []
for nex in e[x]:
l.append(dfs(nex))
l.sort(rev... | p03822 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import *
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(m... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import *
from bisect import bisect_left, bisect_right
import sys
sys.setrecursionlimit(2147483647)
input = sys.stdin.readline
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_()... | p03822 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
a = [None]*(n-1)
from collections import defaultdict
c = defaultdict(list)
for i in range(n-1):
num = int(eval(input()))
c[num].append... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
a = [None]*(n-1)
from collections import defaultdict
c = defaultdict(list)
for i in range(n-1):
num = int(eval(input()))
c[num].append(i... | p03822 |
import sys
sys.setrecursionlimit(10 ** 6)
N, *A = list(map(int, open(0)))
E = [[] for _ in [0] + A]
for i, v in enumerate(A, 1):
E[v - 1] += i,
def dfs(v):
D = sorted(map(dfs, E[v]))
l = len(D)
return max([0] + [l - i + d for i, d in enumerate(D)])
print((dfs(0)))
| import sys
sys.setrecursionlimit(10 ** 6)
N, *A = list(map(int, open(0)))
E = [[] for _ in range(N + 1)]
for i, v in enumerate(A, 1):
E[v - 1].append(i)
def dfs(v):
D = sorted(map(dfs, E[v]))
return max([0] + [len(D) - i + d for i, d in enumerate(D)])
print((dfs(0)))
| p03822 |
import sys
from functools import lru_cache
sys.setrecursionlimit(1000000)
input=sys.stdin.readline
N = int(eval(input()))
par = {i:[] for i in range(1, N+1)}
for i in range(2, N+1):
a = int(eval(input()))
par[a].append(i)
@lru_cache(maxsize=None)
def dfs(s):
depth = 1
res = sorted(dfs(t)... | import sys
from collections import defaultdict
input=sys.stdin.readline
def solve():
N = int(eval(input()))
par = {i:[] for i in range(1, N+1)}
for i in range(2, N+1):
a = int(eval(input()))
par[a].append(i)
q = [1]
l = []
while q:
s = q.pop()
... | p03822 |
import sys
from collections import defaultdict
input=sys.stdin.readline
def solve():
N = int(eval(input()))
par = {i:[] for i in range(1, N+1)}
for i in range(2, N+1):
a = int(eval(input()))
par[a].append(i)
q = [1]
l = []
while q:
s = q.pop()
... | import sys
input=sys.stdin.readline
def solve():
N = int(eval(input()))
par = {i:[] for i in range(1, N+1)}
q = [1]
l = []
dp = [0] * (N+1)
for i in range(2, N+1):
a = int(eval(input()))
par[a].append(i)
while q:
s = q.pop()
l.append(s)
... | p03822 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
NI = lambda : int(sys.stdin.readline())
N = NI()
edge = [[] for _ in range(N+1)]
for i in range(2,N+1):
u = NI()
edge[u].append(i)
def depth(u):
ret = 0
... | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
NI = lambda : int(sys.stdin.readline())
N = NI()
edge = [[] for _ in range(N+1)]
cnt = [0] * (N+1)
for i in range(2,N+1):
u = NI()
edge[i].append(u)
cnt[u]... | p03822 |
n=int(eval(input()))
a=[int(eval(input())) for _ in range(n-1)]
ki=[[] for _ in range(n)]
for i,x in enumerate(a):
ki[x-1].append(i+1)
ans=0
import sys
sys.setrecursionlimit(10**7)
from collections import Counter
def marge(arg):
ret=0
ca=dict(Counter(arg))
m=max(ca.keys())
for i in range(1,m+1)... | n=int(eval(input()))
a=[int(eval(input())) for _ in range(n-1)]
ki=[[] for _ in range(n)]
for i,x in enumerate(a):
ki[x-1].append(i+1)
ans=0
import sys
sys.setrecursionlimit(10**7)
from collections import Counter
def marge(arg):
ret=0
arg.sort(reverse=True)
for i,x in enumerate(arg):
ret=max(... | p03822 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
import heapq
n = int(eval(input()))
T = [[] for _ in range(n)]
for i in range(1, n):
a = int(eval(input()))
a -= 1
T[a].append(i)
def dfs(v):
if not T[v]:
return 0
L = []
for i in T[v]:
heapq.heappush(L, dfs(i)+1... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
import heapq
def main():
n = int(eval(input()))
T = [[] for _ in range(n)]
for i in range(1, n):
a = int(eval(input()))
a -= 1
T[a].append(i)
def dfs(v):
if not T[v]:
return 0
L = []
for i in T[... | p03822 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
import heapq
def main():
n = int(eval(input()))
T = [[] for _ in range(n)]
for i in range(1, n):
a = int(eval(input()))
a -= 1
T[a].append(i)
def dfs(v):
if not T[v]:
return 0
L = []
for i in T[... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
import heapq
def main():
n = int(eval(input()))
T = [[] for _ in range(n)]
for i in range(1, n):
a = int(eval(input()))
a -= 1
T[a].append(i)
def dfs(v):
if not T[v]:
return 0
L = []
for i in T[... | p03822 |
import sys
sys.setrecursionlimit(10**8)
N = int(eval(input()))
A = [int(eval(input()))-1 for i in range(N-1)]
wins = [[] for _ in range(N)]
for i,a in enumerate(A):
wins[a].append(i+1)
depth = [-1] * N
def dep(v):
if len(wins[v])==0: return 0
if depth[v] >= 0:
return depth[v]
ds ... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
N = int(eval(input()))
A = [int(eval(input()))-1 for i in range(N-1)]
wins = [[] for _ in range(N)]
for i,a in enumerate(A):
wins[a].append(i+1)
def depth(v):
if len(wins[v])==0: return 0
res = []
for u in wins[v]:
... | p03822 |
from collections import Counter
n = int(eval(input()))
xs = [None] + [int(eval(input()))-1 for _ in range(n-1)]
count_win = Counter(xs)
q = [i for i in range(n) if not i in count_win]
children = [[] for i in range(n)]
while not q[0]==0:
i = q.pop(0)
children[i].sort(reverse=True)
children[i] ... | from collections import Counter
n = int(eval(input()))
xs = [None] + [int(eval(input()))-1 for _ in range(n-1)]
count_win = Counter(xs)
q = [i for i in range(n) if not i in count_win]
children = [[] for i in range(n)]
qi = 0
while not q[qi]==0:
i, qi = q[qi], qi+1
children[i].sort(reverse=True)
... | p03822 |
import collections, sys
sys.setrecursionlimit(10**5 + 5)
N, *A = [int(_) for _ in open(0).read().split()]
win_lose = {i: set() for i in range(1, N + 1)}
for win, lose in zip(A, list(range(2, N + 1))):
win_lose[win].add(lose)
memo = [-1] * (N + 1)
def rec(x):
if memo[x] == -1:
if win_lose[... | import collections
N, *A = [int(_) for _ in open(0).read().split()]
win_lose = {i: set() for i in range(1, N + 1)}
for win, lose in zip(A, list(range(2, N + 1))):
win_lose[win].add(lose)
s1 = [1]
s2 = []
while s1:
a = s1.pop()
s2 += [a]
for b in win_lose[a]:
s1 += [b]
memo = [0] * ... | p03822 |
import collections
N, *A = [int(_) for _ in open(0).read().split()]
win_lose = {i: set() for i in range(1, N + 1)}
for win, lose in zip(A, list(range(2, N + 1))):
win_lose[win].add(lose)
s1 = [1]
s2 = []
while s1:
a = s1.pop()
s2 += [a]
for b in win_lose[a]:
s1 += [b]
memo = [0] * ... | N, *A = [int(_) for _ in open(0).read().split()]
win_lose = {i: set() for i in range(1, N + 1)}
for win, lose in zip(A, list(range(2, N + 1))):
win_lose[win].add(lose)
s1 = [1]
s2 = []
while s1:
a = s1.pop()
s2 += [a]
for b in win_lose[a]:
s1 += [b]
dp = [0] * (N + 1)
for x in s2[::-... | p03822 |
N, *A = [int(_) for _ in open(0).read().split()]
win_lose = {i: set() for i in range(1, N + 1)}
for win, lose in zip(A, list(range(2, N + 1))):
win_lose[win].add(lose)
s1 = [1]
s2 = []
while s1:
a = s1.pop()
s2 += [a]
for b in win_lose[a]:
s1 += [b]
dp = [0] * (N + 1)
for x in s2[::-... | N, *A = [int(_) for _ in open(0).read().split()]
win_lose = {i: set() for i in range(1, N + 1)}
for win, lose in zip(A, list(range(2, N + 1))):
win_lose[win].add(lose)
s1 = [1]
s2 = []
while s1:
a = s1.pop()
s2 += [a]
for b in win_lose[a]:
s1 += [b]
dp = [0] * (N + 1)
for x in s2[::-... | p03822 |
def myAnswer(N:int)->int:
K = len(str(N)) #桁数
if(K == 1):return N
c = N // 10**(K-1) #最上位の桁の数
if((c*10**(K-1) + int("9"*(K-1)))<= N):
return c + 9 *(K - 1)
else:
return c + 9 *(K - 1) -1
def modelAnswer():
tmp=1
def main():
N = int(eval(input()))
print((myAnswer(N)... | def myAnswer(N:int)->int:
length = len(str(N))
if(length == 1): return N
l = list(str(N))
tmp = 0
for n in l[1:]:
tmp += int(n)
total = length * 9
if(tmp == total - 9):
return tmp + int(l[0])
else:
total += -9 + int(l[0]) - 1
return total
def modelAnswer():
... | p03427 |
import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
s = ins()
... | import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
X = ins()
... | p03427 |
import math
n=int(eval(input()))
s = str(n)
array = list(map(int, list(s)))
a1=sum(array)
size = int (math.log10(n))
a2=int(n/(10**size))-1+size*9
print((max(a1,a2)))
| n = int(eval(input()))
c = None
res = 0
for i in range(1, len(str(n))+1):
c = '9' * i
if int(c) <= n:
continue
else:
for j in range(9, -1, -1):
if int(str(j) + str(c)[1:]) <= n:
c = str(j) + str(c)[1:]
break
break
for i in rang... | p03427 |
n = int(eval(input()))
def digit_sum_simple(n):
max_sum = -1
for i in range(10**(len(str(n))-1)-1, n+1):
i_parts = []
for i_part in str(i):
i_parts.append(int(i_part))
this_sum = sum(i_parts)
if max_sum < this_sum:
... | n = int(eval(input()))
print((sum([int(j) for j in str(int(str(n+1)[0])-1) + "9"*(len(str(n+1))-1)]))) | p03427 |
N = int(eval(input()))
keta = len(str(N))
SN = str(N)
if N <= 9:
print(N)
elif SN.count('9') == keta:
print((9*keta))
elif SN.count('9') == keta-1 and SN[0] != '9':
print(((keta - 1) * 9 + int(SN[0])))
else:
print(((keta - 1) * 9 + int(SN[0])-1)) | n=int(eval(input()))
k=len(str(n))
c=n//10**(k-1)
print((c+9*(k-1) if n==(c+1)*10**(k-1)-1 else c+9*(k-1)-1))
| p03427 |
n=int(eval(input()))
a=int(eval(input()))
if((n%500) <= a):
print('Yes')
else:
print('No')
| n=int(eval(input()))
a=int(eval(input()))
n%=500
if(n<=a):
print('Yes')
else:
print('No')
| p03433 |
N = int(eval(input()))
A = int(eval(input()))
for i in range(A+1):
if (N-i)%500==0:
print('Yes')
break
else:
print('No') | N = int(eval(input()))
A = int(eval(input()))
print(('Yes' if N%500<=A else 'No'))
| p03433 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
def main():
n=int(eval(input()))
a=int(eval(input()))
for i in range(21):
for j in range(a+1):
if 500*i+1*j==n:
return 'Yes'
return 'No'
print((... | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
a=int(eval(input()))
if n%500>a:
print('No')
else:
print('Yes')
resolve() | p03433 |
n = int(eval(input()))
a = int(eval(input()))
if (n % 500) <= a:
print("Yes")
else:
print("No") | print(("Yes" if int(eval(input()))%500<=int(eval(input())) else "No")) | p03433 |
N = int(eval(input())) # total payment amount
A = int(eval(input())) # the amount of 1 Yen
kozeni = N % 500
if kozeni <= A:
print("Yes")
else:
print("No")
| N = int(eval(input()))
A = int(eval(input()))
if (N % 500) <= A:
print("Yes")
else:
print("No") | p03433 |
n=int(eval(input()))
a=int(eval(input()))
print(('YNeos'[n%500>a::2])) | print(('YNeos'[int(eval(input()))%500>int(eval(input()))::2])) | p03433 |
# coding: utf-8
# Your code here!
N = int(eval(input()))
S = int(eval(input()))
if N%500<=S:
print("Yes")
else:
print("No") | # coding: utf-8
# Your code here!
N = int(eval(input()))
A = int(eval(input()))
if N%500 <= A:
print("Yes")
else:
print("No")
| p03433 |
n = int(eval(input()))
a = int(eval(input()))
m = n % 500
if m <= a:
print('Yes')
else:
print('No') | n = int(eval(input()))
a = int(eval(input()))
if n % 500 <= a:
print('Yes')
else:
print('No') | p03433 |
print(('Yes' if int(eval(input()))%500<=int(eval(input())) else 'No'))
| if int(eval(input()))%500<=int(eval(input())):
print("Yes")
else:
print("No") | p03433 |
n = int(eval(input()))
a = int(eval(input()))
if n%500 <= a:
print("Yes")
else:
print("No") | n = int(eval(input()))
a = int(eval(input()))
print(("Yes" if n%500 <= a else "No")) | p03433 |
N = int(eval(input()))
A = int(eval(input()))
if N % 500 <= A:
print("Yes")
else:
print("No") | N = int(eval(input()))
A = int(eval(input()))
print((["Yes", "No"][N % 500 > A])) | p03433 |
n=int(eval(input()))%500
print(('No' if n>int(eval(input())) else 'Yes')) | print(('No'if int(eval(input()))%500>int(eval(input()))else'Yes')) | p03433 |
n = int(eval(input()))
a = int(eval(input()))
q = n % 500
if a >= q:
print('Yes')
else:
print('No') | n =int(eval(input()))
a =int(eval(input()))
print(('Yes' if n %500<=a else 'No')) | p03433 |
n = int(eval(input()))
a = int(eval(input()))
res = n%500
if res <= a:
print('Yes')
else:
print('No') | n = int(eval(input()))
a = int(eval(input()))
n -= (n//500)*500
if n<=a:
print('Yes')
else:
print('No') | p03433 |
n = int(eval(input()))
a = int(eval(input()))
flg = False
for i in range(a+1):
if (n-i) % 500 == 0:
flg = True
break
if flg:
print("Yes")
else:
print("No")
| n = int(eval(input()))
a = int(eval(input()))
if n % 500 <= a:
print("Yes")
else:
print("No")
| p03433 |
a = int(eval(input()))
b = int(eval(input()))
a = a % 500
if a > b:
print("No")
else:
print("Yes") | n = int(eval(input()))
a = int(eval(input()))
n %= 500
if n <= a:
print("Yes")
else:
print("No") | p03433 |
N=int(eval(input()))
A=int(eval(input()))
if N%500<=A:
print("Yes")
else:
print("No") | N=int(eval(input()))
A=int(eval(input()))
print(("Yes" if N%500<=A else "No")) | p03433 |
N = eval(input())
A = eval(input())
n = int(N)
a = int(A)
x = n % 500
if x <= a:
print("Yes")
else:
print("No")
| N = int(eval(input()))
A = int(eval(input()))
num = N % 500
if num <= A:
print("Yes")
else:
print("No")
| p03433 |
if int(eval(input()))%500<=int(eval(input())):
print("Yes")
else:
print("No")
| print((["Yes","No"][int(eval(input()))%500>int(eval(input()))])) | p03433 |
N = int(eval(input()))
A = int(eval(input()))
amari = N % 500
if amari <= A:
print('Yes')
else:
print('No') | n = int(eval(input()))
a = int(eval(input()))
if n%500 <= a:
print("Yes")
else:
print("No")
| p03433 |
# https://atcoder.jp/contests/abc088/tasks/abc088_a
n = int(eval(input()))
a = int(eval(input()))
if (n % 500) > a:
print("No")
else:
print("Yes")
| n = int(eval(input()))
a = int(eval(input()))
if n % 500 <= a:
print("Yes")
else:
print("No")
| p03433 |
N = int(eval(input()))
A = int(eval(input()))
amari = N%500
if amari <= A:
print('Yes')
else:
print('No') | N = int(eval(input()))
A = int(eval(input()))
print(("Yes" if N%500 <= A else "No")) | p03433 |
print(('No' if max(int(eval(input())) % 500 - int(eval(input())), 0) else 'Yes')) | print(('Yes' if int(eval(input())) % 500 <= int(eval(input())) else 'No')) | p03433 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
A = int(eval(input()))
if N % 500 > A:
print("No")
else:
print("Yes") | N = int(eval(input()))
A = int(eval(input()))
print(("No" if N % 500 != 0 and A <N%500< 500 else "Yes")) | p03433 |
while True:
n = int(eval(input()))
if n == 0:
break
hr_lst = []
for _ in range(n):
h, r = list(map(int, input().split()))
hr_lst.append((h, r))
m = int(eval(input()))
for _ in range(m):
h, r = list(map(int, input().split()))
hr_lst.append((h, r))
hr_lst.sort(reverse... | while True:
n = int(eval(input()))
if n == 0:
break
hr_lst = []
for _ in range(n):
h, r = list(map(int, input().split()))
hr_lst.append((h, r))
m = int(eval(input()))
for _ in range(m):
h, r = list(map(int, input().split()))
hr_lst.append((h, r))
hr_lst.sort(reverse... | p00157 |
while True:
n = int(eval(input()))
if n == 0:
break
hr_lst = []
for _ in range(n):
h, r = list(map(int, input().split()))
hr_lst.append((h, r))
m = int(eval(input()))
for _ in range(m):
h, r = list(map(int, input().split()))
hr_lst.append((h, r))
hr_lst.sort(reverse... | while True:
n = int(eval(input()))
if n == 0:
break
hr_lst = []
for _ in range(n):
h, r = list(map(int, input().split()))
hr_lst.append((h, r))
m = int(eval(input()))
for _ in range(m):
h, r = list(map(int, input().split()))
hr_lst.append((h, r))
hr_lst.sort(reverse... | p00157 |
N=int(eval(input()))
L=[]
L=list(map(int,input().split()))
L.sort()
sum=0
for i in range(0,N):
if(L[i*2]<L[(i*2)+1]):
sum+=L[i*2]
else:
sum+=L[i*2]
print(sum)
| N=int(eval(input()))
L=[]
L=list(map(int,input().split()))
L.sort()
sum=0
for i in range(0,N):
sum+=L[i*2]
print(sum)
| p04047 |
# coding: utf-8
N = int(eval(input()))
lst = sorted(map(int, input().split()))
print((sum([lst[i] for i in range(2*N) if i %2==0]))) | # coding: utf-8
N = int(eval(input()))
lst = sorted(map(int, input().split()))
print((sum(lst[::2]))) | p04047 |
N = int(eval(input()))
L = list(map(int, input().split(" ")))
L = sorted(L)
tmp= 0
for i in range(N):
tmp += L[i*2]
print(tmp) | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
l = sorted(list(map(int, input().split())), reverse=True)
ans = 0
for i in range(0, N*2, 2):
ans += min(l[i], l[i+1])
print(ans)
if __name__ == "__main__":
main() | p04047 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | p04047 |
n = int(eval(input()))
l = tuple(sorted(map(int, input().split())))
print((sum(l[::2]))) | eval(input())
print((sum(sorted(map(int, input().split()))[::2])))
| p04047 |
eval(input());print((sum(sorted(map(int,input().split()))[::2]))) | n,l=open(0);print((sum(sorted(map(int,l.split()))[::2]))) | p04047 |
N = int(eval(input()))
kushi = sorted(list(map(int,input().split())))
sum = 0
for i in range(2*N):
if i % 2 == 0:
sum += kushi[i]
print(sum)
| N = int(eval(input()))
kushi = sorted(list(map(int,input().split())))
sum = 0
for i in range(0,2*N,2):
sum += kushi[i]
print(sum)
| p04047 |
n = int(eval(input()))
l = list(map(int, input().split()))
l = sorted(l, reverse=True)
t = 0
for i in range(1, n * 2, 2):
t += min(l[i], l[i-1])
print(t)
| n = int(eval(input()))
l = sorted(list(map(int, input().split())), reverse=True)
t = 0
for i in range(1, n * 2, 2):
t += min(l[i], l[i-1])
print(t)
| p04047 |
N = int(eval(input()))
src = list(map(int,input().split()))
src.sort()
ans = 0
for a,b in zip(src[::2],src[1::2]):
ans += a
print(ans) | N = int(eval(input()))
L = list(map(int,input().split()))
L.sort(reverse=True)
ans = 0
for a,b in zip(L[::2],L[1::2]):
ans += min(a,b)
print(ans) | p04047 |
N = int(eval(input()))
L = list(map(int,input().split()))
L = sorted(L)
ans = 0
while len(L) :
if len(L) == 1 :
ans += L[0]
L.pop(0)
else :
ans += L.pop(0)
L.pop(0)
print(ans)
| N = int(eval(input()))
L = list(map(int,input().split()))
L = sorted(L)
ans = 0
for i in range(0, 2*N, 2) :
ans += L[i]
print(ans)
| p04047 |
"#!/usr/bin/env python3"
N = int(eval(input()))
L = list(map(int,input().split()))
L = sorted(L)
ans = 0
for i in range(0, 2*N, 2) :
ans += L[i]
print(ans)
| N = int(eval(input()))
L = list(map(int,input().split()))
L.sort()
ans = 0
for i in range(0,2*N,2) :
ans += L[i]
print(ans)
| p04047 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=sorted(a)
c=set(a)
count=0
for i in c:
if b.count(i)==i:
count+=0
elif b.count(i)>=i:
count+=b.count(i)-i
else:
count+=b.count(i)
print(count) | n=int(eval(input()))
a=list(map(int,input().split()))
b=sorted(a)#n
c=list(set(b))
c.sort()
kosuu_list=[]
kosuu=1
for i in range(len(b)-1):
#kosuu=0
#print(b[i])
if b[i]==b[i+1]:
kosuu+=1
else:
kosuu_list.append(kosuu)
kosuu=1
kosuu_list.append(b.count(b[-1]))
#pr... | p03489 |
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
count = 0
while a:
k = a.pop(0)
k_count = 1
while (len(a) > 0) and (a[0] == k):
a.pop(0)
k_count += 1
if k_count < k:
count += k_count
else:
count += k_count - k
print(count)
| N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
count = 0
while a:
k = a.pop(-1)
k_count = 1
while (len(a) > 0) and (a[-1] == k):
a.pop(-1)
k_count += 1
if k_count < k:
count += k_count
else:
count += k_count - k
print(count)
| p03489 |
N = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
S = 0
for i in range(100000):
tmp = a.count(i + 1)
S += tmp
if tmp > i + 1:
cnt += tmp - i - 1
elif tmp < i + 1:
cnt += tmp
cnt += N - S
print(cnt)
| N = int(eval(input()))
a = list(map(int, input().split()))
tmp = 1
cnt = 0
S = 0
a.sort()
a.append(0)
for i in range(N):
if a[i] == a[i + 1]:
tmp += 1
else:
if tmp > a[i]:
cnt += tmp - a[i]
elif tmp < a[i]:
cnt += tmp
tmp = 1
print(cnt)
| p03489 |
N = int(eval(input()))
l = list(map(int, input().split()))
unique_l = list(set(l))
ans = 0
for i in unique_l:
cnt = l.count(i)
if cnt==i:
pass
elif cnt > i:
ans += cnt - i
elif cnt < i:
ans += cnt
print(ans) | N = int(eval(input()))
l = list(map(int, input().split()))
unique_l = list(set(l))
unique_l.sort()
l.sort()
l.append(0)
ans = 0
j = 0
cnt =[]
for i in unique_l:
temp = 0
while l[j] == i and j < N:
temp += 1
j += 1
cnt.append(temp)
for i, j in zip(unique_l, cnt):
if i == j... | p03489 |
import sys
def main():
while True:
m = eval(input())
if m == 0: return 0
dp = {}
dp[(0, 0)] = 1
for i in range(m):
v, c = list(map(int, input().split()))
for j in range(1001):
for k in range(c + 1):
key = (i + 1, j + v * k)
dp.setdefault(key, 0)
dp[key] += dp.get((i, j... | import sys
from array import array
def main():
while True:
m = eval(input())
if m == 0: return 0
dp = [array('I', [0] * 1001) for i in range(m + 1)]
dp[0][0] = 1
for i in range(m):
v, c = list(map(int, input().split()))
for j in range(1001):
for k in range(c + 1):
next = j + v * ... | p00154 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): r... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | p03626 |
while True:
n = int(eval(input()))
if n == 0:
break
for _ in range(n):
p = list(map(int, input().split()))
if 100 in p:
print("A")
elif (p[0] + p[1]) // 2 >= 90:
print("A")
elif sum(p) // 3 >= 80:
print("A")
elif... | while True:
n = int(eval(input()))
if n == 0:
break
for _ in range(n):
p = list(map(int, input().split()))
x = sum(p) // 3
if 100 in p:
print("A")
elif (p[0] + p[1]) // 2 >= 90:
print("A")
elif x >= 80:
print("A"... | p00218 |
import sys
def solve():
file_input = sys.stdin
N, K = list(map(int, file_input.readline().split()))
G = [[] for i in range(10)]
for line in file_input:
c, g = list(map(int, line.split()))
G[g - 1].append(c)
for genre in G:
genre.sort(reverse=True)
... | import sys
def solve():
file_input = sys.stdin
N, K = list(map(int, file_input.readline().split()))
G = [[] for i in range(10)]
for line in file_input:
c, g = list(map(int, line.split()))
G[g - 1].append(c)
for genre in G:
genre.sort(reverse=True)
... | p00484 |
from heapq import heappush as push
from heapq import heappop as pop
def solve():
n, k = list(map(int,input().split()))
group_num = 10
book_map = [[] for i in range(group_num)]
acc_map = [[0] for i in range(group_num)]
for i in range(n):
c,g = list(map(int,input().split()))
push(book_map... | def solve():
n, k = list(map(int,input().split()))
group_num = 10
book_map = [[] for i in range(group_num)]
acc_map = [[0] for i in range(group_num)]
for i in range(n):
c,g = list(map(int,input().split()))
book_map[g - 1].append(c)
for i in range(group_num):
bmi = book_map[i]
... | p00484 |
# Acceptance of input
import sys
file_input = sys.stdin
V, E = list(map(int, file_input.readline().split()))
D = [[] for i in range(V)]
for line in file_input:
s, t, d = list(map(int, line.split()))
D[s].append((t, d))
max_d = 15001
# Full search with bit mask
def tsp(v, b):
if b == (... | max_d = 15001
# Acceptance of input
import sys
file_input = sys.stdin
V, E = list(map(int, file_input.readline().split()))
D = [[max_d] * V for i in range(V)]
for line in file_input:
s, t, d = list(map(int, line.split()))
D[s][t] = d
# Full search with bit mask
def tsp(v, b):
if b == ... | p02323 |
# Acceptance of input
import sys
file_input = sys.stdin
V, E = list(map(int, file_input.readline().split()))
max_d = 1001
adj = [[] for i in range(V)]
for line in file_input:
s, t, d = list(map(int, line.split()))
adj[s].append((t, d))
max_path = 15001
dp = [[max_path] * (1 << V) for i in ra... | import sys
file_input = sys.stdin
V, E = list(map(int, file_input.readline().split()))
no_route = 15001
# (v-1) th vertex is excluded
dp = [[no_route] * (V - 1) for i in range(1 << (V - 1))]
adj = [[] for i in range(V)]
for line in file_input:
s, t, d = list(map(int, line.split()))
if s == ... | p02323 |
def solve():
from heapq import heappop, heappush
V, E = list(map(int, input().split()))
edges = [[] for _ in [0]*V]
for _ in [0]*E:
s, t, d = list(map(int, input().split()))
edges[s].append((t, d))
result = float("inf")
for i in range(V):
q = [(0, i, {i})]
... | def solve():
V, E = list(map(int, input().split()))
edges = [[] for _ in [0]*V]
for _ in [0]*E:
s, t, d = list(map(int, input().split()))
edges[s].append((t, d))
result = float("inf")
beam_width = 80
for i in range(V):
q = [(0, i, {i})]
for j in range(... | p02323 |
def solve():
V, E = list(map(int, input().split()))
edges = [[] for _ in [0]*V]
for _ in [0]*E:
s, t, d = list(map(int, input().split()))
edges[s].append((t, d))
result = float("inf")
beam_width = 80
for i in range(V):
q = [(0, i, {i})]
for j in range(... | def solve():
V, E = list(map(int, input().split()))
edges = [[] for _ in [0]*V]
for _ in [0]*E:
s, t, d = list(map(int, input().split()))
edges[s].append((t, d))
result = float("inf")
beam_width = 70
for i in range(V):
q = [(0, i, {i})]
for j in range(... | p02323 |
V, E = list(map(int, input().split()))
g = [[] for i in range(V)]
for i in range(E):
s, t, d = list(map(int, input().split()))
g[s].append((t, d))
INF = 10**9
dp = [[-1]*V for i in range(2**V)]
tmp = {}
def dfs(state, v, s):
if dp[state][v] != -1:
return dp[state][v]
if state == 2**V-... | V, E = list(map(int, input().split()))
g = [[] for i in range(V)]
cost = {}
for i in range(E):
s, t, d = list(map(int, input().split()))
g[s].append((t, d))
cost[s,t] = d
get = cost.get
INF = 10**9
ALL = 2**V-1
dp = [[-1]*V for i in range(2**V)]
def dfs(state, v, s):
if dp[state][v] != -1:
... | p02323 |
import sys
readline = sys.stdin.readline
V, E = list(map(int, readline().split()))
g = [[] for i in range(V)]
cost = {}
to = [0]*V
for i in range(E):
s, t, d = list(map(int, readline().split()))
g[s].append((t, d))
cost[s,t] = d
to[s] |= 1 << t
get = cost.get
INF = 10**9
ALL = 2**V-1
dp = ... | import sys
readline = sys.stdin.readline
V, E = list(map(int, readline().split()))
g = [[] for i in range(V)]
cost = {}
to = [0]*V
for i in range(E):
s, t, d = list(map(int, readline().split()))
g[s].append((t, d))
cost[s,t] = d
to[s] |= 1 << t
get = cost.get
INF = 10**9
ALL = 2**V-1
dp = ... | p02323 |
def dfs(g, last, vs, first):
if vs:return min(g[last][v] + dfs(g, v, vs - {v}, first) for v in vs)
else:return g[last][first]
from sys import stdin
from collections import defaultdict
from math import isinf
readline = stdin.readline
v, e = list(map(int, readline().split()))
g = [[float('inf')] * v... | from sys import stdin
from math import isinf
readline = stdin.readline
min_cost = float('inf')
def main():
v, e = list(map(int, readline().split()))
g = [[float('inf')] * v for _ in range(v)]
for _ in range(e):
s, t, d = list(map(int, readline().split()))
g[s][t] = d
... | p02323 |
from sys import stdin
from collections import defaultdict
from math import isinf
readline = stdin.readline
from collections import deque
def main():
v, e = list(map(int, readline().split()))
g = [[float('inf')] * v for _ in range(v)]
for _ in range(e):
s, t, d = list(map(int, readline... | from sys import stdin
from collections import defaultdict
from math import isinf
readline = stdin.readline
min_cost = float('inf')
def main():
v, e = list(map(int, readline().split()))
g = [[float('inf')] * v for _ in range(v)]
for _ in range(e):
s, t, d = list(map(int, readline().spl... | p02323 |
from sys import stdin
from collections import defaultdict
from math import isinf
readline = stdin.readline
min_cost = float('inf')
def main():
v, e = list(map(int, readline().split()))
g = [[float('inf')] * v for _ in range(v)]
for _ in range(e):
s, t, d = list(map(int, readline().spl... | # http://www.geocities.jp/m_hiroi/light/pyalgo65.html
def memoize(f):
table = {}
def func(*args):
if not args in table:
table[args] = f(*args)
return table[args]
return func
@memoize
def tsp(p, v):
if (1 << point_size) - 1 == v:
return distance_table[p]... | p02323 |
v,e=list(map(int,input().split()))
dis=[[float("inf")]*v for _ in range(v)]
for i in range(e):
s,t,d=list(map(int,input().split()))
dis[s][t]=d
dp=[[float('inf')]*(v) for _ in range(1<<v)]
dp[1][0]=0
for i in range(1<<v):
for j in range(v):
if dp[i][j]==float('inf'):continue
for k ... | v,e=list(map(int,input().split()))
dist=[[float("inf")]*v for _ in range(v)]
for i in range(e):
s,t,d=list(map(int,input().split()))
dist[s][t]=d
dp=[[float('inf')]*(v) for _ in range(1<<v)]
dp[1][0]=0
for i in range(1<<v):
for j in range(v):
if dp[i][j]==float('inf'):continue
fo... | p02323 |
def main():
""""ここに今までのコード"""
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
data = tuple(map(int,read().split()))
m1 = data[0]
ab = data[1:1+2*m1]
m2 = data[1+2*m1]
cd = dat... | def main():
""""ここに今までのコード"""
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
data = tuple(map(int,read().split()))
m1 = data[0]
ab = data[1:1+2*m1]
m2 = data[1+2*m1]
cd = dat... | p02737 |
from collections import defaultdict
M = 998244353
B = 10**18 % M
def mex(s):
for i in range(max(s)+2):
if i not in s:
return i
def calc_grandy(e):
g = {}
rev_g = defaultdict(set)
rev_g[0] = set(range(1, N+1))
for i in sorted(list(e.keys()), reverse=True):
m = mex({g.get(j,0) fo... | from collections import defaultdict
M = 998244353
B = 10**18 % M
def mex(s):
for i in range(max(s)+2):
if i not in s:
return i
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
... | p02737 |
from collections import defaultdict
M = 998244353
B = 10**18 % M
def mex(s):
for i in range(max(s)+2):
if i not in s:
return i
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
... | from collections import defaultdict
M = 998244353
B = 10**18 % M
def mex(s):
for i in range(max(s)+2):
if i not in s:
return i
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
... | p02737 |
from collections import defaultdict
M = 998244353
B = 10**18 % M
def mex(s):
for i in range(max(s)+2):
if i not in s:
return i
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
... | from collections import defaultdict
M = 998244353
B = 10**18 % M
def mex(s):
for i in range(N+1):
if i not in s:
return i
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
z1, z... | p02737 |
from collections import defaultdict
M = 998244353
B = pow(10, 18, M)
N = int(eval(input()))
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
z1, z2 = m, z1
return x1, y1
def inv_mod(a, b,... | from collections import defaultdict
M = 998244353
B = pow(10, 18, M)
N = int(eval(input()))
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
z1, z2 = m, z1
return x1, y1
def inv_mod(a, b,... | p02737 |
from collections import defaultdict
M = 998244353
B = pow(10, 18, M)
N = int(eval(input()))
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
z1, z2 = m, z1
return x1, y1
def inv_mod(a, b,... | from collections import defaultdict
M = 998244353
B = pow(10, 18, M)
N = int(eval(input()))
def geometric_mod(a, r, m, n):
x = a
for i in range(n):
yield x
x = (x*r)%m
BB = list(geometric_mod(1, B, M, N+2))
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1... | p02737 |
from collections import defaultdict
M = 998244353
B = pow(10, 18, M)
N = int(eval(input()))
def geometric_mod(a, r, m, n):
x = a
for i in range(n):
yield x
x = (x*r)%m
BB = list(geometric_mod(1, B, M, N+2))
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1... | from collections import defaultdict
import sys
input = lambda: sys.stdin.readline().rstrip()
M = 998244353
B = pow(10, 18, M)
N = int(eval(input()))
def geometric_mod(a, r, m, n):
x = a
for i in range(n):
yield x
x = (x*r)%m
BB = list(geometric_mod(1, B, M, N+2))
def ext_euc(a, b):
x1... | p02737 |
from collections import defaultdict
import sys
input = lambda: sys.stdin.readline().rstrip()
M = 998244353
B = pow(10, 18, M)
N = int(eval(input()))
def geometric_mod(a, r, m, n):
x = a
for i in range(n):
yield x
x = (x*r)%m
BB = list(geometric_mod(1, B, M, N+2))
def ext_euc(a, b):
x1... | from collections import defaultdict
import sys
input = lambda: sys.stdin.readline().rstrip()
M = 998244353
B = pow(10, 18, M)
N = int(eval(input()))
def geometric_mod(a, r, m, n):
x = a
for i in range(n):
yield x
x = (x*r)%m
BB = list(geometric_mod(1, B, M, N+2))
def ext_euc(a, b):
x1... | p02737 |
from collections import defaultdict
import sys
input = lambda: sys.stdin.readline().rstrip()
M = 998244353
B = pow(10, 18, M)
N = int(eval(input()))
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1,... | from collections import defaultdict
import sys
input = lambda: sys.stdin.readline().rstrip()
M = 998244353
B = pow(10, 18, M)
N = int(eval(input()))
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1,... | p02737 |
from collections import defaultdict
import sys
input = lambda: sys.stdin.readline().rstrip()
M = 998244353 # < (1 << 30)
def mod_inv(a, M=M):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, M
while abs(z1) != 1:
d, m = divmod(z2, z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
z1, z2 = m, z... | from collections import defaultdict
import sys
input = lambda: sys.stdin.readline().rstrip()
def mod_inv(a):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, M
while z1 != 1:
d, m = divmod(z2, z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
z1, z2 = m, z1
return x1%M
def mex(s):
for i ... | p02737 |
def calc():
def mex(i):
D = {}
for j in X[i]:
D[G[j]] = 1
for g in range(N + 1):
if g not in D:
return g
M = int(eval(input()))
X = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
... | import sys
input = lambda: sys.stdin.readline().rstrip()
def calc():
def mex(i):
t = 0
for j in X[i]:
t |= 1 << G[j]
t = ~t
return (t & -t).bit_length() - 1
M = int(eval(input()))
X = [[] for _ in range(N)]
for _ in range(M):
a, b = list(... | p02737 |
N = int(eval(input()))
S = [int(eval(input())) for i in range(N)]
dp = {}
dp[0] = True
for s in S:
keys = list(dp.keys())
for k in keys:
dp[k + s] = True
res = 0
for k in list(dp.keys()):
if k % 10 == 0:
continue
res = max(res, k)
print(res)
| N = int(eval(input()))
S = [int(eval(input())) for i in range(N)]
T = list([x for x in S if x % 10 > 0])
res = sum(S)
if res % 10 == 0:
if len(T) == 0:
res = 0
else:
res -= min(T)
print(res)
| p03701 |
n=int(eval(input()))
s=[int(eval(input())) for i in range(n)]
memo=[[0]*20000 for i in range(200)]
def dp(score, i):
if i==n:
if score%10==0:
memo[i][score]=0
return 0
else:
memo[i][score]=score
return score
if memo[i][score]>0:
... | n=int(eval(input()))
s=[int(eval(input())) for i in range(n)]
memo=[[-1]*20000 for i in range(200)]
def dp(score, i):
if i==n:
if score%10==0:
memo[i][score]=0
return 0
else:
memo[i][score]=score
return score
if memo[i][score]>=0:
... | p03701 |
import itertools
N = int(eval(input()))
lst = []
# listにN個の数値を格納
for i in range(N):
lst.append(int(eval(input())))
l_sum = sum(lst)
p_list = []
if l_sum % 10 == 0:
# enumerate()関数を使うと、forループの中でリスト（配列）インデックス番号（カウント、順番）を取得できる
# i にインデックス番号が入る
for i, _ in enumerate(lst, 1):
... | N = int(eval(input()))
lst = []
# listにN個の数値を格納
for i in range(N):
lst.append(int(eval(input())))
lst.sort()
lstsum = sum(lst)
p_list = [ i / 10 for i in lst if i % 10 != 0 ]
if len(p_list) == 0:
print((0))
elif lstsum % 10 != 0:
print(lstsum)
else:
for i in range(N):
ans = l... | p03701 |
N = int(eval(input()))
nums=[int(eval(input())) for _ in range(N)]
MAX = 10*4
sum_num = sum(nums)
dp = [0] * (sum_num+1)
dp[0] = 1
for num in nums:
for i in range(sum_num+1)[::-1]:
if dp[i] == 1 and i + num <= sum_num:
dp[i+num] = 1
ans = 0
for i in range(sum_num+1):
if dp[i] == 1 and i%10 != ... | N = int(eval(input()))
nums=[int(eval(input())) for _ in range(N)]
sum_num = sum(nums)
dp = [0] * (sum_num+1)
dp[0] = 1
for num in nums:
for i in range(sum_num+1)[::-1]:
if dp[i] == 1 and i + num <= sum_num:
dp[i+num] = 1
ans = 0
for i in range(sum_num+1):
if dp[i] == 1 and i%10 != 0:
ans ... | p03701 |
N = int(eval(input()))
nums=[int(eval(input())) for _ in range(N)]
sum_num = sum(nums)
dp = [0] * (sum_num+1)
dp[0] = 1
for num in nums:
for i in range(sum_num+1)[::-1]:
if dp[i] == 1 and i + num <= sum_num:
dp[i+num] = 1
ans = 0
for i in range(sum_num+1):
if dp[i] == 1 and i%10 != 0:
ans ... | N = int(eval(input()))
nums=[int(eval(input())) for _ in range(N)]
sum_num = sum(nums)
dp = [0] * (sum_num+1)
dp[0] = 1
for num in nums:
for i in range(sum_num+1)[::-1]:
if dp[i] == 1:
dp[i+num] = 1
ans = 0
for i in range(sum_num+1):
if dp[i] == 1 and i%10 != 0:
ans = i
print(ans)
| p03701 |
N = int(eval(input()))
nums=[int(eval(input())) for _ in range(N)]
MAX = 10**4
dp = [0] * (MAX+1)
dp[0] = 1
for num in nums:
for i in range(MAX+1)[::-1]:
if dp[i] == 1 and (i + num) <= MAX+1:
dp[i+num] = 1
ans = 0
for i in range(MAX+1):
if dp[i] == 1 and i%10 != 0:
ans = i
print(ans)
| N = int(eval(input()))
nums=[int(eval(input())) for _ in range(N)]
MAX = 10**4
dp = [0] * (MAX+1)
dp[0] = 1
for num in nums:
for i in range(MAX+1)[::-1]:
if dp[i] == 1 and (i + num) <= MAX:
dp[i+num] = 1
ans = 0
for i in range(MAX+1):
if dp[i] == 1 and i%10 != 0:
ans = i
print(ans)
| p03701 |
n = int(eval(input()))
s = []
for i in range(n):
s.append(int(eval(input())))
s.sort(reverse=True)
tmp = sum(s)
ruiseki = [tmp]
for i in range(n-1):
ruiseki.append(ruiseki[-1] - s[i])
ans = 0
def DFS(depth, now):
global ans
if depth == n:
if now%10 != 0:
ans =... | n = int(eval(input()))
s = []
geta = 0
for i in range(n):
a = int(eval(input()))
if a % 10 == 0:
geta += a
else:
s.append(a)
n = len(s)
s.sort(reverse=True)
tmp = sum(s)
ruiseki = [tmp]
for i in range(n-1):
ruiseki.append(ruiseki[-1] - s[i])
ans = 0
def DFS(dept... | p03701 |
x,a,b = list(map(int,input().split()))
print(([0,'B','A'][(abs(x-a)>abs(x-b))-(abs(x-a)<abs(x-b))])) | x,a,b=list(map(int,input().split()))
print(('AB'[abs(x-a)>abs(x-b)])) | p03623 |
Sunuke, A ,B = list(map(int,input().split()))
if abs(Sunuke-A) < abs(Sunuke-B):
print("A")
else:
print("B") | Sunuke, A ,B = list(map(int,input().split()))
print(("A"if abs(Sunuke-A) < abs(Sunuke-B) else "B")) | p03623 |
x,a,b = input().split()
x = int(x)
a = int(a)
b = int(b)
if x < a:
distance_xa = a - x
else:
distance_xa = x - a
if x < b:
distance_xb = b - x
else:
distance_xb = x - b
if distance_xa < distance_xb:
print("A")
else:
print("B") | x,a,b = input().split()
x = int(x)
a = int(a)
b = int(b)
# print("x = ", x)
# print("a = ", a)
# print("b = ", b)
if x < a:
distance_xa = a - x
else:
distance_xa = x - a
# print("distance_xa = ", distance_xa)
if x < b:
distance_xb = b - x
else:
distance_xb = x - b
# print("distance... | p03623 |
x,a,b = (int(i) for i in input().split())
print(("A" if abs(x-a) < abs(x-b) else "B")) | def main():
x, a, b = (int(i) for i in input().split())
if abs(a - x) < abs(b - x):
print("A")
else:
print("B")
if __name__ == '__main__':
main()
| p03623 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.