input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def make_divisors(n):
"""自然数nの約数を列挙したリストを出力する
計算量: O(sqrt(N))
入出力例: 12 -> [1, 2, 3, 4, 6, 12]
"""
divisors = []
for k in range(1, int(n**0.5) + 1):
if n % k == 0:
divisors.append(k)
if k != n // k:
divisors.append(n // k)
divisors = ... | def make_divisors(n: int) -> list:
"""自然数nの約数を列挙したリストを出力する
計算量: O(sqrt(N))
入出力例: 12 -> [1, 2, 3, 4, 6, 12]
"""
divisors = []
for k in range(1, int(n ** 0.5) + 1):
if n % k == 0:
divisors.append(k)
if k != n // k:
divisors.append(n // k)
... | p02881 |
def divisor(n):
# 約数
return [[i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0]
def main():
N = int(eval(input()))
print((divisor(N)[-1][0] + divisor(N)[-1][1] - 2))
return
main()
| def divisor(n):
# 約数
return [[i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0]
def main():
N = int(eval(input()))
rslt = divisor(N)
print((rslt[-1][0] + rslt[-1][1] - 2))
return
main()
| p02881 |
n=int(eval(input()))
def divisor(n):
i = 1
table = []
while i * i <= n:
if n%i == 0:
table.append(i)
table.append(n//i)
i += 1
table = list(set(table))
return table
a=divisor(n)
a.sort()
c=[]
for i in range(len(a)//2+1):
d=a[i]-1+a[-i... | import sys
n=int(eval(input()))
c=[]
for i in range(2,int(n**(1/2))+1):
if n%i==0:
c.append(i+n//i-2)
if len(c)==0:
print((n-1))
sys.exit()
print((min(c))) | p02881 |
N = int(eval(input()))
ans = 10 ** 19
for i in range(1, int(N**.5) + 1):
if N % i == 0:
ans = min(ans, i + N // i -2)
print(ans) | n = int(eval(input()))
for i in range(int(n**.5) + 1, 0, -1):
if n % i == 0:
ans = n // i + i - 2
print(ans)
exit() | p02881 |
# C - Walk on Multiplication Table
# https://atcoder.jp/contests/abc144/tasks/abc144_c
n = int(eval(input()))
ans = 10 ** 12
for i in range(1, 10 ** 6 + 1):
if n % i == 0:
ans = min(ans, n // i + i)
print((ans - 2)) | # C - Walk on Multiplication Table
# https://atcoder.jp/contests/abc144/tasks/abc144_c
n = int(eval(input()))
ans = n
for i in range(1, int(n**.5) + 2):
if n % i == 0:
ans = min(ans, n // i + i - 2)
print(ans) | p02881 |
import math
INF = 1e12
n = int(eval(input()))
cnt = INF
m = math.sqrt(n)
for i in range(1, math.ceil(m) + 1):
if n % i == 0:
j = n // i
cnt = min(cnt, i + j - 2)
else:
continue
print(cnt) | from math import ceil
def divisors(n):
res = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
n = int(eval(input()))
divs = divisors(n)
ans = 10 ** 12
divs.sort()
for i in rang... | p02881 |
N = int(eval(input()))
x = int(N ** 0.5)
for i in range(x):
if N % x == 0:
y = N // x
break
x -= 1
ans = x + y - 2
print(ans)
| N = int(eval(input()))
x = int(N ** 0.5)
for i in range(x, 0, -1):
if N % i == 0:
y = N // i
break
ans = N // y + y - 2
print(ans)
| p02881 |
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append((i,n//i))
if i != n // i:
divisors.append((n//i,i))
# divisors.sort()
return divisors
N=int(eval(input()))
div=make_divisors(N)
ans=float("inf... | N = int(eval(input()))
def divisors(n):
ret = set()
for i in range(1, int(n**(0.5))+1):
if n % i == 0:
ret.add(i)
return(ret)
ans = N-1
for x in divisors(N):
ans = min(ans, x-1+(N//x)-1)
print(ans)
| p02881 |
import math
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
def solve():
n = int(eval(input()))
if is_prime(n):
print((n-1))
return
half = int(math.sqrt(n))
for... | import math
def is_prime(n):
if n == 1: return (False, -1)
for k in range(int(math.sqrt(n)) + 1, 1, -1):
if n % k == 0:
return (False, k)
return (True, 1)
def solve():
n = int(eval(input()))
p, k = is_prime(n)
if p:
print((n-1))
return
... | p02881 |
n = int(eval(input()))
c = max([i for i in range(1,int(n**0.5+1)) if n%i==0])
print((c+n//c-2)) | a = int(eval(input()))
c = [j for j in range(1,int(a**0.5)+1) if a%j==0]
if c:
print(((max(c)-1) + (a//max(c)-1)))
else:
print((a-1)) | p02881 |
from functools import reduce
from copy import copy
N = int(eval(input()))
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
ar... | N = int(eval(input()))
answer = 1000000000000
for i in range(1, int(N ** (0.5)) + 2):
if N % i == 0:
j = N // i
if i + j - 2 < answer:
answer = i + j - 2
print(answer) | p02881 |
N = int(eval(input()))
a, b = 1, N
for n in range(2,N):
if n*n == N:
a = b = n
break
elif n*n > N:
break
elif N%n == 0:
a, b = n, N//n
print((a+b-2)) | N=int(eval(input()))
ans = 10**12
for n in range(1,int(N**0.5)+1):
if N%n==0:
ans = min(ans, n + N//n - 2)
print(ans) | p02881 |
n=int(eval(input()))
num=int(n**0.5)+1
mini=float('inf')
for k in range(1,num+1):
i=k
j=0
if n%i==0:
j=n//i
if j!=0 and mini>=i+j-2:
mini=i+j-2
print(mini)
| n=int(eval(input()))
ans=10**12
for i in range(1,int(n**0.5)+1):
if n%i==0:
ans=min(ans,i+n//i-2)
print(ans) | p02881 |
import math
N = int(eval(input()))
# n = p * q → p or q <= n**(1/2)
# because p and q > n**(1/2) → p * q > n
divisor = []
for i in range(1 , math.floor(N**(1/2))+1):
if N % i == 0:
divisor.append(i)
distance = []
for j in range(int(len(divisor))):
M = (N / int(divisor[j])) + int(diviso... | n = int(eval(input()))
ans = 10**12
for i in range(1,int((n**0.5))+1):
if n % i == 0:
j = n // i
dis = i + j - 2
ans = min(ans,dis)
print(ans) | p02881 |
def enum_div_pairs(n):
res = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append((i, n // i))
if i != n // i:
res.append((n // i, i))
return res
pairs = enum_div_pairs(int(eval(input())))
print((min(i + j - 2 for i, j in pairs)))
| def get_nearest_div_pair(n):
for i in range(int(n ** 0.5), 0, -1):
if n % i != 0:
continue
return i + n // i - 2
print((get_nearest_div_pair(int(eval(input())))))
| p02881 |
#%%
#%%
n = int(eval(input()))
def factorize(n):
b = 2
fct = []
while b * b <= n:
while n % b == 0:
n //= b
fct.append(b)
b = b + 1
if n > 1:
fct.append(n)
return fct
l = factorize(n)
import itertools
c = list(itertools.produc... | #%%
n = int(eval(input()))
a = 10**15
x = int(n**0.5)
x += 1
for i in range(x, 1, -1):
if n%i == 0:
a = i
b = n//i
break
#print(a, b)
if a == 10**15:
print((n-1))
else:
print((a+b-2)) | p02881 |
import math
N = int(eval(input()))
lst =[]
#N = a*bとする。 ここで、a<=bが成り立つ。
#√a の全探索
length= math.ceil(math.sqrt(N))
for i in range(length):
if(N %(i+1) == 0):
lst.append(i+1)
a = max(lst)
b = round(N/a)
ans = a+b -2
print(ans) | import math
n = int(eval(input()))
a=0
b=0
root_n = math.sqrt(n)
#繰り上げ
root_n = math.ceil(root_n)
yakusuu =[]
for i in range(1,root_n+1):
if(n%i == 0):
yakusuu.append(i)
a = max(yakusuu)
b = n / a
print((int(a+b-2)))
| p02881 |
import itertools
from functools import reduce
from operator import mul
def trial_division(n):
factors = []
f = 2
while f**2 <= n:
if n % f == 0:
n //= f
factors.append(f)
else:
f += 1
if n != 1:
factors.append(n)
return factors
N = int(eval(input()))
factors... | N = int(eval(input()))
ans = N**2
for i in range(1, int(N**(1/2))+1):
if N % i == 0:
j = N // i
ans = min(ans, (i-1)+(j-1))
print(ans)
| p02881 |
n = int(eval(input()))
a = [1, n]
for i in range(1, int(n**0.5)+1):
j = n // i
if n % i == 0 and a[0] + a[1] > i + j:
a = [i, j]
print((a[0] - 1 + a[1] - 1)) | n = int(eval(input()))
#(1,1)から一番長く移動しないといけないのは(1,n)の時
ans = n - 1
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
ans = min(ans, i + int(n/i) - 2)
print(ans) | p02881 |
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
n = int(eval(input()))
d = make_divisors(n)
d.sort()
a = []
f... | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
n = int(eval(input()))
d = make_divisors(n)
d.sort()
a = []
for i in range(len(d)-1):
... | p02881 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | p02881 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | p02881 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.... | p02881 |
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
num = int(eval(input()))
yaku = make_divisors(num)
ans = float("i... | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(int(i+n/i-2))
return divisors
ans = float("inf")
for i in make_divisors(int(eval(input()))):
ans = min(ans,i)
print(ans) | p02881 |
n=int(eval(input()))
a=[]
ans=1e12
l=int(n**0.5)+2
for i in range(1,l):
if i in a:
continue
elif n%i==0:
a.append(i)
a.append(n//i)
ans=min(ans,(i+n//i-2))
print(ans) | n=int(eval(input()))
a=[]
ans=1e12
l=int(n**0.5)+2
for i in range(1,l):
if n%i==0 and i not in a:
a.append(i)
a.append(n//i)
ans=min(ans,(i+n//i-2))
print(ans) | p02881 |
si = lambda: eval(input())
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
snm = lambda: list(map(str, input().split()))
nl = lambda: list(map(int, input().split()))
n=ni()
ans=10**13
for i in range(1,int(n**0.5)+1):
j=n//i
if n%i==0:
ans=min(ans,i+j)
print((ans... | n=int(eval(input()))
ans=10**13
for i in range(1,int(n**0.5)+1):
j=n//i
if n%i==0:
ans=min(ans,i+j)
print((ans-2))
| p02881 |
n=int(eval(input()))
ans=10**13
for i in range(1,int(n**0.5)+1):
j=n//i
if n%i==0:
ans=min(ans,i+j)
print((ans-2))
| n=int(eval(input()))
ans=10**18
for i in range(1,int(n**0.5)+1):
if n%i!=0:continue
j=n//i
t=i+j-2
ans=min(t,ans)
print(ans) | p02881 |
import math
n = int(eval(input()))
a,b = 1,n
for i in range(1,int(math.sqrt(n)+1)):
if n%i == 0:
q = n//i
if abs(a-b) > abs(q-i):
a,b = i,q
print(((a-1) + (b-1))) | import math
n = int(eval(input()))
ans = float("inf")
for i in range(1,int(math.sqrt(n)+1)):
if n%i == 0:
if (i-1)+(n//i-1) < ans:
ans = (i-1)+(n//i-1)
print(ans) | p02881 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
tmp = 10 ** 24
tmp2 = 1
tmp3 = 1
for i in range(1, 10 ** 6 + 1):
if n % i == 0 and i + (n / i) < tmp:
tmp = i + (n // i)
tmp2 = i
tmp3 = n // i
print((tmp2 + tmp3 - 2))
| # -*- coding: utf-8 -*-
n = int(eval(input()))
tmp = pow(10, 13)
for i in range(1, int(pow(n, 0.5)) + 1):
if n % i == 0 and abs(n // i - i) < tmp:
tmp = abs(n // i - i)
ans1 = n // i
ans2 = i
#print(tmp, ans1, ans2)
print((ans1 + ans2 - 2))
| p02881 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
ans = pow(10, 30)
for i in range(1, int(pow(n, 0.5)) + 1):
if n / i == n // i:
j = n // i
if i + j - 2 < ans:
ans = i + j - 2
print(ans)
| # -*- coding: utf-8 -*-
n = int(eval(input()))
ans = [10 ** 14, 10 ** 14]
for i in range(1, int(pow(n, 0.5)) + 1):
if n % i == 0:
tmp = n // i
if tmp + i < sum(ans):
ans = [i, tmp]
print((sum(ans) - 2))
| p02881 |
N = int(eval(input()))
ans = float('inf')
for i in range(1,int(N**0.5) + 1):
tmp = N / i
if tmp.is_integer():
if tmp == N:
tmp_ans = N - 1
else:
tmp_ans = int(tmp) + i - 2
if ans > tmp_ans:
ans = tmp_ans
print(ans) | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
10
N = int(eval(input()))
divisors = make_divisors(N)
ans = float(... | p02881 |
from sys import stdin
import math
n = int(stdin.readline().rstrip())
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return d... | n = int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
mi = 10**15
for i in make_divisors(n):
... | p02881 |
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
N = int(eval(input()))
a = make_divisors(N)
b = []
c = []
... | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
N = int(eval(input()))
a = make_divisors(N)
b = []
c = []
for j in range(len(a)):
... | p02881 |
import itertools
from functools import reduce
N = int(eval(input()))
def prime_f(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
... | import itertools
from functools import reduce
N = int(eval(input()))
distance = []
C = []
def prime_f(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
... | p02881 |
n = int(eval(input()))
ans = n-1
cnt = 2
while cnt <= int(n**0.5)+1:
if n%cnt==0:
ans = min(ans, (cnt-1)+(n//cnt-1))
cnt += 1
print(ans) | n = int(eval(input()))
print((min(a+(n//a)-2 for a in range(1, int(n**0.5)+1) if n%a==0))) | p02881 |
N = int(eval(input()))
ans = 10 ** 18
for i in range(1, int(N ** 0.5) + 1):
if N % i == 0:
j = N // i
ans = min(ans, i + j - 2)
print(ans)
| N = int(eval(input()))
ans = 10 ** 18
for i in range(1, int(N ** 0.5 + 0.5) + 1):
if N % i == 0:
walk = i + N // i - 2
ans = min(ans, walk)
print(ans)
| p02881 |
import math
N = int(eval(input()))
lim = int(math.sqrt(N))
x = 1
while True:
if N % lim == 0:
x = lim
break
lim = lim - 1
y = N // lim
print(((x - 1) + (y - 1))) | import math
N = int(eval(input()))
max = 0
max2 = 0
for i in range(2, int(math.sqrt(N)+ 2)):
if N % i == 0:
max = i
max2 = N // i
if max != 0:
print((max + max2 - 2))
else:
print((N -1))
#print(max, max2)
| p02881 |
L = int(eval(input()))
a=[int(eval(input())) for i in range(L)]
if L == 1:
print((0))
exit()
rightsum = [0]*(L+1)
leftsum = [0]*(L+1)
for i in range(1,L+1):
rightsum[i] = rightsum[i-1]+a[i-1]
leftsum[L-i] = leftsum[L+1-i]+a[L-i]
leftsum=leftsum[::-1]
Reright = [0]
Goright = [0]
for ... | L = int(eval(input()))
a=[int(eval(input())) for i in range(L)]
if L == 1:
print((0))
exit()
#累積和
rightsum = [0]*(L+1)
leftsum = [0]*(L+1)
for i in range(1,L+1):
rightsum[i] = rightsum[i-1]+a[i-1]
leftsum[i] = leftsum[i-1]+a[L-i]
#Re:戻ってくる Go:戻ってこなくてもよい
Reright = [0]
Goright = [0]
for ... | p03132 |
L=int(eval(input()))
A=[int(eval(input())) for _ in range(L)]
INF=2*L
dp=[[INF for _ in range(5)] for _ in range(L+1)]
for j in range(5):
dp[0][j]=0
for i in range(1,L+1):
a=A[i-1]
if A[i-1]==0:
o=2
else:
o=A[i-1]%2
e=(A[i-1]+1)%2
dp[i][0]=dp[i-1][0]+... | L=int(eval(input()))
A=[int(eval(input())) for _ in range(L)]
dp=[0 for _ in range(5)]
for i in range(1,L+1):
a=A[i-1]
back = a%2 if a>0 else 2
through = (a+1)%2
dp[4] = min(dp[0:5]) + a
dp[3] = min(dp[0:4]) + back
dp[2] = min(dp[0:3]) + through
dp[1] = min(dp[0:2]) + back
... | p03132 |
L, *A = list(map(int, open(0)))
D = [(2, 1), (1, 0), (0, 1)]
s0 = s1 = s2 = s3 = s4 = 0
for a in A:
e, o = D[(a - 1) % 2 + 1 if a else 0]
s0 += a
s1 = s0 if s0 < s1 + e else s1 + e
s2 = s1 if s1 < s2 + o else s2 + o
s3 = s2 if s2 < s3 + e else s3 + e
s4 = s3 if s3 < s4 + a else ... | def main():
L, *A = list(map(int, open(0)))
D = [(2, 1), (1, 0), (0, 1)]
s0 = s1 = s2 = s3 = s4 = 0
for a in A:
e, o = D[(a - 1) % 2 + 1 if a else 0]
s0 += a
s1 = s0 if s0 < s1 + e else s1 + e
s2 = s1 if s1 < s2 + o else s2 + o
s3 = s2 if s2 < s3 ... | p03132 |
# -*- coding: utf-8 -*-
l = int(eval(input()))
al = [int(eval(input())) for _ in range(l)]
INF = 10**15
dp = [[INF]*5 for _ in range(l+1)] # 0,偶数,奇数,偶数,0の状態
dp[0][0] = 0
def cost(i, k):
# i番目を状態kにした時に必要な回数
if k==0 or k==4:
return al[i]
elif k==1 or k==3:
if al[i]>0:
... | # -*- coding: utf-8 -*-
l = int(eval(input()))
al = [int(eval(input())) for _ in range(l)]
INF = 10**15
dp = [INF]*5 # 0,偶数,奇数,偶数,0の状態
dp[0] = 0
def cost(i, k):
# i番目を状態kにした時に必要な回数
if k==0 or k==4:
return al[i]
elif k==1 or k==3:
if al[i]>0:
return al[i]%2
... | p03132 |
#https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_d
#2019-02-10
#DP
L = int(eval(input()))
A = [int(eval(input())) for i in range(L)]
DP = [[float("inf") for i in range(5)] for j in range(L+1)]
for i in range(5):
DP[0][i] = 0
def cost(s, i, A):
if s == 0 or s == 4:
... | #https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_d
#2019-02-10
#DP
L = int(eval(input()))
A = [int(eval(input())) for i in range(L)]
DP = [[0 for i in range(5)] for j in range(L+1)]
def cost(s, i, A):
if s == 0 or s == 4:
return A[i]
elif s == 1 or s == 3:
... | p03132 |
#https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_d
#2019-02-11
#DP
L = int(eval(input()))
DP = [0 for i in range(5)]
def cost(a):
if a:
return [a, a%2, (a+1)%2, a%2, a]
else:
return [0, 2, 1, 2, 0]
def list_add(in1, in2):
return [a + b for a... | #https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_d
#2019-02-11
#DP
L = int(eval(input()))
DP = [0 for i in range(5)]
def cost(a):
if a:
return [a, a%2, (a+1)%2, a%2, a]
else:
return [0, 2, 1, 2, 0]
def list_add(in1, in2):
return [a + b for a... | p03132 |
l = int(eval(input()))
a = []
for i in range(l):
a.append(int(eval(input())))
dp=[[0]*5 for i in range(l+1)]
for i in range(0,l):
if a[i]==0:
even=2
else:
even=a[i]%2
dp[i+1][0]=dp[i][0]+a[i]
dp[i+1][1]=min(dp[i][0],dp[i][1]) + even
dp[i+1][2]=min(dp[i][0],dp[i][1],dp[i][2]) + ... | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
# 0区間、偶数区間(2以上)、奇数区間、偶数区間(2以上)、0区間
dp = [[0] * (5) for i in range(n + 1)]
for i in range(n):
dp[i + 1][0] = dp[i][0] + a[i]
dp[i + 1][1] = min(dp[i][0:2]) + (a[i] % 2)
if a[i] == 0:
dp[i + 1][1] += 2
dp[i +... | p03132 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
b = [0]*n
for i in range(n):
if a[i]%2:
b[i] = 1
elif a[i]:
b[i] = 2
a.append(0)
b.append(0)
n += 1
DP = [[[10**18 for i in range(3)] for j in range(3)] for k in range(n+1)]
for i in range(3... | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
b = [0]*n
for i in range(n):
if a[i]%2:
b[i] = 1
elif a[i]:
b[i] = 2
DP = [[10**18 for i in range(5)] for j in range(n+1)]
for i in range(5):
DP[0][i] = 0
for i in range(1,n+1):
for j ... | p03132 |
import sys
def main():
input = sys.stdin.readline
mod = 998244353
a, b, c, d = list(map(int, input().split()))
dp = dict()
for i in range(a, c+1):
for j in range(b, d+1):
if i == a and j == b:
dp[(i, j)] = 1
continue
... | import sys
def main():
input = sys.stdin.readline
mod = 998244353
a, b, c, d = list(map(int, input().split()))
dp = [[0]*(d+1) for _ in range(c+1)]
for i in range(a, c+1):
for j in range(b, d+1):
if i == a and j == b:
dp[i][j] = 1
... | p02634 |
import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
from functools import lru_cache
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 998244353
def read_values(): return list(map(int, input().split()))
def read_index(): return [int(x) - 1 for x in inpu... | import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
from functools import lru_cache
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 998244353
def read_values(): return list(map(int, input().split()))
def read_index(): return [int(x) - 1 for x in inpu... | p02634 |
MOD = 998244353
HALF = (MOD + 1) // 2
def solve(a, b, c, d):
dp1 = [[0] * (d + 1) for _ in range(c + 1)]
dp2 = [[0] * (d + 1) for _ in range(c + 1)]
dp3 = [[0] * (d + 1) for _ in range(c + 1)]
dp1[a][b] = 1
dp2[a][b] = 0
dp3[a][b] = 0
for i in range(a + 1, c + 1):
dp1[i... | MOD = 998244353
def solve(a, b, c, d):
dp1 = [[0] * (d + 1) for _ in range(c + 1)]
dp2 = [[0] * (d + 1) for _ in range(c + 1)]
dp3 = [[0] * (d + 1) for _ in range(c + 1)]
dp1[a][b] = 1
dp2[a][b] = 0
dp3[a][b] = 0
for i in range(a + 1, c + 1):
dp1[i][b] = (pow(b - 1, i - ... | p02634 |
a,b,c,d = input().strip().split(' ')
a = int(a)
b = int(b)
c = int(c)
d = int(d)
ans = []
for i in range(a, c + 1):
ans.append([])
for j in range(b, d + 1):
if a == i and j == b:
ans[i - a].append(1)
elif a == i:
ans[i - a].append(i * ans[i - a][j - b - 1])
elif b == j:
a... | a,b,c,d = input().strip().split(' ')
a = int(a)
b = int(b)
c = int(c)
d = int(d)
ans = [[], []]
for i in range(a, c + 1):
i1 = 0 if i % 2 == 0 else 1
i2 = 0 if i1 == 1 else 1
ans[i1] = []
for j in range(b, d + 1):
if a == i and j == b:
ans[i1].append(1)
elif a == i:
ans[i1].app... | p02634 |
import sys
input = sys.stdin.readline
mod = 998244353
A, B, C, D = list(map(int, input().split()))
dp = [[0] * (D+1) for _ in range(C+1)]
dp[A][B] = 1
for i in range(A+1, C+1):
dp[i][B] = dp[i-1][B] * B % mod
for j in range(B, D):
for i in range(A, C+1):
x = dp[i][j] * i
dp[i][j+1... | import sys
input = sys.stdin.readline
mod = 998244353
A, B, C, D = list(map(int, input().split()))
dp = [[0] * (D+1) for _ in range(C+1)]
dp[A][B] = 1
for i in range(A, C+1):
if i > A:
dp[i][B] = dp[i-1][B] * B % mod
for j in range(B+1, D+1):
dp[i][j] = dp[i][j-1] * i + dp[i-1][j] ... | p02634 |
import sys
sys.setrecursionlimit(10**7)
MOD = 998244353
A,B,C,D= list(map(int,input().split()))
#A,B,C,D = 1,1,100,100
def dpinit(ps, val=0):
res = [val for i in [0]*ps[-1]]
for i in ps[:-1][::-1]:
res = [res[:] for k in [0]*i]
return res
memo = dpinit((C+1,D+1))
memo[A][B] = 1
for... | import sys
sys.setrecursionlimit(10**7)
MOD = 998244353
A,B,C,D= list(map(int,input().split()))
#A,B,C,D = 1,1,3000,3000
def dpinit(ps, val=0):
res = [val for i in [0]*ps[-1]]
for i in ps[:-1][::-1]:
res = [res[:] for k in [0]*i]
return res
memo = dpinit((C+1,D+1))
memo[A][B] = 1
... | p02634 |
import sys
sys.setrecursionlimit(10 ** 4)
MOD = 998244353
def solve(A, B, C, D):
cache = {}
def numWays(rows, cols):
if rows == A and cols == B:
return 1
key = rows * 4096 + cols
if key not in cache:
assert rows >= A and cols >= B
... | MOD = 998244353
def solve(A, B, C, D):
numWays = [[None for c in range(D + 1)] for r in range(C + 1)]
numWays[A][B] = 1
for rows in range(A, C + 1):
for cols in range(B, D + 1):
if rows == A and cols == B:
continue
ways = 0
if rows... | p02634 |
A,B,C,D = list(map(int,input().split()))
MOD = 998244353
dp = [[0 for _ in range(D+1)] for _ in range(C+1)]
dp[A][B] = 1
#dp[i][j] ヨコi番目でそこまでの最大の高さがj
for i in range(A,C+1):
for j in range(B,D+1):
if i > A:
dp[i][j] += dp[i-1][j]*j
if j > B:
dp[i][j] += dp[i][j-1]*i
if i > A and ... | A,B,C,D = list(map(int,input().split()))
MOD = 998244353
dp = [[0 for _ in range(D+1)] for _ in range(C+1)]
dp[A][B] = 1
for i in range(A,C+1):
for j in range(B,D+1):
if i > A or j > B:
dp[i][j] += dp[i-1][j]*j+dp[i][j-1]*i-dp[i-1][j-1]*(i-1)*(j-1)
dp[i][j] %= MOD
ans = dp[C][D]
print(ans)... | p02634 |
#import numpy as np
import math
import collections
import bisect
a, b, c, d = list(map(int, input().split()))
dp = [[[1 for k in range(2)] for i in range(d + 1)] for j in range(c + 1)]
for k in range(2):
for i in range(c + 1):
for j in range(d + 1):
dp[i][j][1] = 0
... | #import numpy as np
import math
import collections
import bisect
def main():
a, b, c, d = list(map(int, input().split()))
dp0 = [[1 for i in range(d + 1)] for j in range(c + 1)]
dp1 = [[0 for i in range(d + 1)] for j in range(c + 1)]
for i in range(c + 1):
for j in range(d + 1):
... | p02634 |
a,b,c,d=list(map(int,input().split()))
m=998244353
D=[[0]*(d+1)for _ in range(c+1)]
D[a][b]=1
for i in range(a,c+1):
for j in range(b,d+1):
D[i][j]+=(D[i][j-1]*i+D[i-1][j]*j-D[i-1][j-1]*(i-1)*(j-1))%m
print((D[c][d])) | a,b,c,d=list(map(int,input().split()));m=998244353;D=[[0]*(d+1)for _ in range(c+1)];D[a][b]=1
for i in range(a,c+1):
for j in range(b,d+1):
x=D[i-1]
D[i][j]+=(D[i][j-1]*i+x[j]*j-x[j-1]*(i-1)*(j-1))%m
print((D[c][d])) | p02634 |
A,B,C,D=list(map(int,input().split()))
mod=998244353
dp=[[[0 for k in range(2)] for i in range(D+1)] for i in range(C+1)]
dp[C][D][0]=1
dp[C][D][1]=1
for i in range(D-1,B-1,-1):
dp[C][i][0]=(dp[C][i+1][1]*C)%mod
dp[C][i][1]=(dp[C][i+1][1]*C)%mod
for j in range(C-1,A-1,-1):
dp[j][D][0]=(dp[j+1][D][0... | A,B,C,D=list(map(int,input().split()))
mod=998244353
dpx=[[0 for i in range(D+1)] for j in range(C+1)]
dpy=[[0 for i in range(D+1)] for j in range(C+1)]
dpx[C][D]=1
dpy[C][D]=1
for i in range(D-1,B-1,-1):
dpx[C][i]=(dpy[C][i+1]*C)%mod
dpy[C][i]=(dpy[C][i+1]*C)%mod
for j in range(C-1,A-1,-1):
dpx[j... | p02634 |
A,B,C,D=list(map(int,input().split()))
mod=998244353
dp=[[0 for y in range(D-B+1)]for x in range(C-A+1)]
dp[0][0]=1
for x in range(C-A):
dp[x+1][0]=(dp[x][0]*B)%mod
for y in range(D-B):
dp[0][y+1]=(dp[0][y]*A)%mod
for x in range(C-A):
for y in range(D-B):
dp[x+1][y+1]=(dp[x+1][y]*(A+x))%mo... | A,B,C,D=list(map(int,input().split()))
mod=998244353
dp=[[0 for y in range(D-B+1)]for x in range(C-A+1)]
dp[0][0]=1
for x in range(C-A):
dp[x+1][0]=(dp[x][0]*B)%mod
for y in range(D-B):
dp[0][y+1]=(dp[0][y]*A)%mod
for x in range(C-A):
for y in range(D-B):
dp[x+1][y+1]=(dp[x+1][y]*(A+x+1)+d... | p02634 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
"""
dp、無理な組み合わせを引く、追加された黒マスの数は決まっている
各マスのdp
下から来たものと左から来たものをdpで保持
下から来たものは次だけ制約あり
dp = [下から、左から]
"""
MOD = 998244353
A, B, C, D = lr() # Cは縦
dp = [[[0, 0] for _ in ra... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
"""
各マスのdp
下から来たものと左から来たものを足す
その後、重なっているところを引く
"""
MOD = 998244353
A, B, C, D = lr() # Cは縦
dp = [[0] * (D+1) for _ in range(C+1)] # 1-indexed
dp[A][B] = 1
for i in ... | p02634 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
"""
各マスのdp
下から来たものと左から来たものを足す
その後、重なっているところを引く
"""
MOD = 998244353
A, B, C, D = lr() # Cは縦
dp = [[0] * (D+1) for _ in range(C+1)] # 1-indexed
dp[A][B] = 1
for i in ... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
"""
各マスのdp
下から来たものと左から来たものを足す
その後、重なっているところを引く
"""
MOD = 998244353
A, B, C, D = lr() # Cは縦
dp = [[0] * (D+1) for _ in range(C+1)] # 1-indexed
dp[A][B] = 1
for i in ... | p02634 |
import sys
from collections import defaultdict
def solve():
input = sys.stdin.readline
A, B, C, D = list(map(int, input().split()))
mod = 998244353
DP = defaultdict(int)
DP[(A, B)] = 1
for cb in range(B + 1, D + 1):
DP[(A, cb)] = (DP[(A, cb - 1)] * A) % mod
for ca in ra... | import sys
from collections import defaultdict
def solve():
input = sys.stdin.readline
A, B, C, D = list(map(int, input().split()))
mod = 998244353
DP = [[0 for j in range(D + 1)] for i in range(C + 1)]
DP[A][B] = 1
for b in range(B + 1, D + 1):
DP[A][b] = (DP[A][b-1] * A) %... | p02634 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
... | p02634 |
a,b,c,d=list(map(int,input().split()))
mod=998244353
dct=[[[-1]*3 for _ in range(d+1)] for _ in range(c+1)]
import sys
sys.setrecursionlimit(10**7)
def dp(i,j,bl):
#print(i,j,bl)
if dct[i][j][bl]>0:
return dct[i][j][bl]
if (i,j)==(a,b):
return 1 if bl==0 else 0
if i<a or j<b:
return 0
... | a,b,c,d=list(map(int,input().split()))
mod=998244353
dp1=[[0]*(d+1) for _ in range(c+1)]
dp2=[[0]*(d+1) for _ in range(c+1)]
for i in range(b+1,d+1):
if a==1:
dp1[a][i]=1 if i==b+1 else 0
dp2[a][i]=0 if i==b+1 else 1
else:
dp1[a][i]=(pow(a-1,i-b-1,mod)*(i-b))%mod
dp2[a][i]=(pow(a,i-b,m... | p02634 |
def main():
A, B, C, D = list(map(int, input().split()))
c = C - A
d = D - B
mod = 998244353
dp = [[0]*(d+1) for i in range(c+1)]
dp[0][0] = 1
for i in range(c+1):
prev = dp[i-1]
crr = dp[i]
if i < c:
next = dp[i+1]
for j in range(d... | def main():
A, B, C, D = list(map(int, input().split()))
c = C - A
d = D - B
mod = 998244353
dp = [[0]*(d+1) for i in range(c+1)]
dp[0][0] = 1
for i in range(c+1):
for j in range(d+1):
ret = 0
if i == 0 and j == 0:
continue
... | p02634 |
def main():
A, B, C, D = list(map(int, input().split()))
mod = 998244353
dp = [[0] * (D + 1) for _ in range(C + 1)]
dp[A][B] = 1
for b in range(B + 1, D + 1):
dp[A][b] = dp[A][b - 1] * A
for a in range(A + 1, C + 1):
dp[a][B] = dp[a - 1][B] * B % mod
for b in ran... | def main():
A, B, C, D = list(map(int, input().split()))
mod = 998244353
u = [0] * (D + 1)
v = [0] * (D + 1)
u[B] = 1
for b in range(B + 1, D + 1):
u[b] = u[b - 1] * A
for a in range(A + 1, C + 1):
v[B] = u[B] * B % mod
for b in range(B + 1, D + 1):
... | p02634 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
from functools import lru_cache
INF = float("inf")
MOD = 998244353 # type: int
def main():
A, B, C, D = list(map(int, input().split()))
@lru_cache(maxsize=None)
def f(a, b):
if a < A or b < B:
return 0
... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
from functools import lru_cache
INF = float("inf")
MOD = 998244353 # type: int
def main():
A, B, C, D = list(map(int, input().split()))
DP = [[1]*(D-B+1) for _ in range(C-A+1)]
for i in range(C-A+1):
for j in range(D-B... | p02634 |
a,b,c,d=list(map(int,input().split()))
p=998244353
n=c-a+2
m=d-b+2
data=[[0]*(m)for i in range(n)]
data[1][1]=1
#print(data)
for i in range(1,n):
gyou=a+i-1
for j in range(1,m):
retu=b+j-1
if(i*j==1):
continue
data[i][j]=data[i-1][j]*retu+data[i][j-1]*gyou-... | a,b,c,d=list(map(int,input().split()))
p=998244353
n=c-a+2
m=d-b+2
data=[[0]*(m)for i in range(n)]
data[1][1]=1
#print(data)
for i in range(1,n):
gyou=a+i-1
for j in range(1,m):
retu=b+j-1
if(i*j==1):
continue
data[i][j]=(data[i-1][j]*retu%p)+(data[i][j-1]*... | p02634 |
A,B,C=list(map(int,input().split()))
print((max(A,B,C)*9+A+B+C)) | A,B,C=list(map(int,input().split()))
maxa=max(A,B,C)
print((maxa*9+A+B+C)) | p03250 |
a,b,c = sorted(input().split())[::-1]
print((int(a+b)+int(c)))
| A=sorted(map(int,input().split()))[::-1]
print((10*A[0]+A[1]+A[2]))
| p03250 |
a, b, c = sorted(map(int, input().split()))
print((c*10 + b + a)) | a, b, c = list(map(int, input().split()))
print((max(a, b, c)*9 + (a + b + c))) | p03250 |
a,b,c=list(map(int,input().split()))
if(a>=b):
if(a>=c):
print(((a*10)+b+c))
else:
print(((c*10)+a+b))
elif (b>=c):
print((b * 10 + a + c)) | a,b,c=sorted(map(int,input().split()))
print((c*10+a+b)) | p03250 |
def big(a, b, c):
if a>=b and a>=c:
g = a
elif b>=a and b>=c:
g = b
else:
g = c
return g
n = list(map(int, input().split()))
a, b, c = n[0], n[1], n[2]
g1, g2 = 0, 0
g1 = big(a, b, c)
if g1 == a:
a = 0
elif g1 == b:
b = 0
else:
c = 0
g2 =... | s = input()
a,b,c = list(map(int, s.split(" ")))
l=[a,b,c]
l.sort(reverse=True)
m = l[0] * 10 + l[1] + l[2]
print(m) | p03250 |
l =[int(x) for x in input().split()]
l.sort(reverse=True)
print((int(int(l[0])*10 + int(l[1])+int(l[2])))) | a = [int(_) for _ in input().split()]
a.sort(reverse =True)
print((a[0]*10 + a[1] +a[2])) | p03250 |
def LI(): return list(map(str, input().split()))
A = LI()
A.sort(reverse=True)
print((int(A[0] +A[1]) +int(A[2])))
| def LI(): return list(map(int, input().split()))
A,B,C = LI()
max_value = max([A*10+B+C,A+B*10+C,A+B+C*10])
print(max_value) | p03250 |
from itertools import permutations
from copy import copy
choices = list(map(int, input().split()))
combs = permutations(choices, 2)
res = 0
for comb in combs:
left = copy(choices)
for num in comb:
left.remove(num)
right = int(str(comb[0]) + str(comb[1]))
total = left[0] + right
... | choices = list(map(int, input().split()))
choices.sort(reverse=True)
print((int(str(choices[0]) + str(choices[1])) + choices[2]))
| p03250 |
a,b,c = sorted(map(int, input().split()),reverse=True)
print((a*10+b+c))
| *A,= list(map(int, input().split()))
A.sort(reverse=True)
print((A[0]*10+A[1]+A[2]))
| p03250 |
A,B,C=list(map(int,input().split()))
print((max([A*10+B+C,A+B*10+C,A+B+C*10]))) | A=list(map(int,input().split()))
A.sort()
print((A[0]+A[1]+10*A[2]))
| p03250 |
def nl(): return list(map(int, input().split()))
# print('Yes' if a else 'No')
arr = nl()
print((max(arr) * 9 + sum(arr))) | ary = list(map(int, input().split()))
ans = sum(ary) + 9 * max(ary)
print(ans) | p03250 |
A,B,C=sorted(map(int,input().split()))
print((10*C+B+A)) | ABC=list(map(int,input().split()))
print((sum(ABC)+max(ABC)*9)) | p03250 |
a, b, c = sorted(map(int, input().split()))
print((c*10+a+b)) | *x,=list(map(int,input().split()));print((sum(x)+max(x)*9)) | p03250 |
a,b,c=sorted(map(int,input().split()))
print((10*c+b+a)) | a,b,c=sorted(list(map(int,input().split())))
print((c*10+b+a)) | p03250 |
S = input().split()
S.sort(reverse=True)
print((10 * int(S[0]) + int(S[1]) + int(S[2])))
| A, B, C = sorted(map(int, input().split()))
print((C * 10 + A + B)) | p03250 |
def func():
A, B, C = list(map(str, input().split()))
cand1 = int(A + B) + int(C)
cand2 = int(B + C) + int(A)
cand3 = int(A + C) + int(B)
cand4 = int(B + A) + int(C)
cand5 = int(C + B) + int(A)
cand6 = int(C + A) + int(B)
print((max(cand1, cand2, cand3, cand4, cand5, cand6)))
... | def func():
A, B, C = list(map(int, input().split()))
cand1 = A * 10 + B + C
cand2 = B * 10 + A + C
cand3 = C * 10 + A + B
print((max(cand1, cand2, cand3)))
if __name__ == '__main__':
func()
| p03250 |
l = sorted(list(map(int, input().split())))
print((l[2] * 10 + l[1] + l[0])) | l = sorted(list(map(int, input().split())), reverse = True)
print((l[0] * 10 + l[1] + l[2])) | p03250 |
*l,=list(map(int,input().split()))
l.sort()
print((l[2]*10+l[1]+l[0])) | l=sorted(map(int,input().split()))
print((l[2]*10+sum(l[:2]))) | p03250 |
num = list(map(int, input().split()))
num.sort(reverse=True)
print((10*num[0] + num[1] + num[2])) | l = list(input().split())
l.sort(reverse=True)
print((int(''.join(l[:2])) + int(l[2]))) | p03250 |
li = list(map(int,input().split()))
li = sorted(li, reverse=True)
print((10*li[0]+li[1]+li[2])) | L = sorted(list(map(int, input().split())))
print((10*L[2]+L[1]+L[0])) | p03250 |
X = list(map(int, input().split()))
S = sorted(X, reverse=True)
X, Y = S[0] * 10 + S[1], S[2]
print((X + Y)) | A = list(map(int, input().split()))
A.sort(reverse=True)
print((A[0] * 10 + A[1] + A[2])) | p03250 |
A=list(map(int,input().split()))
A=sorted(A,reverse=True)
ans=10*A[0]+A[1]+A[2]
print(ans) | A=list(map(int,input().split()))
ans=sum(A)+9*max(A)
print(ans) | p03250 |
a = sorted(list(map(int, input().split())),reverse=True)
print((a[0]*10+a[1]+a[2]))
| a = sorted(list(map(int, input().split())),reverse=True)
print((sum(a)+a[0]*9))
| p03250 |
def getN():
return int(eval(input()))
def getMN():
a = input().split()
b = [int(i) for i in a]
return b[0],b[1]
def getlist():
a = input().split()
b = [int(i) for i in a]
return b
a,b,c = getlist()
m = max([a,b,c])
print((10*m + a+ b+ c -m)) | a, b, c = list(map(int, input().split()))
big = max([a,b,c])
print((sum([a,b,c]) + 9*big)) | p03250 |
a,b,c=list(map(int,input().split()))
if b<=c:
d=b
b=c
c=d
if a<=b:
d=a
a=b
b=d
if b<=c:
d=b
b=c
c=d
print((10*a+b+c))
| A,B,C=sorted(map(int,input().split()))
print((10*C+B+A)) | p03250 |
num = list(map(int,input().split()))
num.sort(reverse=True)
print((num[0]*10+num[1]+num[2])) | N = list(map(int,input().split()))
N.sort()
print((N[2]*10+N[1]+N[0])) | p03250 |
import itertools, copy
n = input().split()
ans = 0
for p0, p1 in itertools.permutations(n, 2):
n_ = copy.copy(n)
n_.remove(p0)
n_.remove(p1)
total = int(''.join([p0, p1])) + int(n_[0])
ans = max(ans, total)
print(ans) | n = list(map(int, input().split()))
nmax = max(n)
n.remove(nmax)
ans = nmax * 10 + sum(n)
print(ans) | p03250 |
x,y,z = list(map(int,input().split()))
print((max(x,y,z) * 10 + x + y + z - max(x,y,z))) | l=list(map(int,input().split()));print((max(l)*9+sum(l))) | p03250 |
A = sorted([int(i) for i in input().split()])
print((A[2]*10 + sum(A[:2]))) | A, B, C = list(map(int, input().split()))
x = A * 10 + B + C
y = A + 10 * B + C
z = A + B + 10 * C
print((max(x, y, z))) | p03250 |
a = list(map(int, input().split()))
a.sort()
print((a[2]*10+a[1]+a[0])) | a = list(map(int,input().split()))
print((sum(a)+max(a)*9)) | p03250 |
n=int(eval(input()))
a=list(map(int,input().split()))
def valid():
b = list(range((n+1)&1, n+1, 2))
for i in range(len(b)-1, -1, -1):
b.insert(i, b[i])
if b[0] == 0:
b = b[1:]
return list(sorted(a)) == b
ans,mod = 1,10**9+7
for i in range(n//2):
ans = (ans * 2) % mod
prin... | n=int(eval(input()))
a=list(sorted(map(int,input().split())))
def valid():
cur=(n+1)&1
for i in range(n):
if n&1==0 and i&1==0 and i>0:
cur+=2
if n&1==1 and i&1==1:
cur+=2
if a[i] != cur: return False
return True
print((2**(n//2)%(10**9+7) if valid(... | p03848 |
n = int(eval(input()))
a = list(map(int, input().split()))
if n % 2 == 0:
for i in range(n//2):
if a.count(2*i + 1) != 2:
print((0))
exit()
else:
if a.count(0) != 1:
print((0))
exit()
for i in range(1,n//2+1):
if a.count(2*i) != 2:
... | n = int(eval(input()))
a = list(map(int, input().split()))
d = 0
if n % 2 == 0:
for i in range(n//2):
d += (2*i + 1) * 2
if d != sum(a):
print((0))
exit()
else:
for i in range(1, n//2+1):
d += 4 * i
if d != sum(a):
print((0))
exit()
... | p03848 |
from collections import Counter
N = int(eval(input()))
lstA = list(map(int, input().split()))
mod = 10**9 + 7
countA = Counter(lstA)
ans = 0
if N % 2:
if countA[0] == 1 and all(countA[i] == 2 for i in range(2, N, 2)):
ans = pow(2, N//2, mod)
else:
if all(countA[i] == 2 for i in range(1, ... | from collections import Counter
N = int(eval(input()))
lstA = list(map(int, input().split()))
mod = 10**9 + 7
countA = Counter(lstA)
ans = 0
if N % 2:
if countA[0] == 1 and all(countA[i] == 2 for i in range(2, N, 2)):
ans = pow(2, N//2) % mod
else:
if all(countA[i] == 2 for i in range(1,... | p03848 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
n = int(eval(input()))
a = list(map(int, input().split()))
if(n % 2 == 0):
for i in range(1, n, 2):
if(a.count(i) != 2):
print((0))
exit(0)
print(... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
# print(a)
if(n % 2 == 0):
for i in range(n-1):
if i % 2 == 0 and a[i] != a[i+1] or i % 2 == 1 and a[i]+2 != a[... | p03848 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.