input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
#print(a)
fr = 0
ba = n+1
while ba-fr > 1:
mi = (ba+fr+1) // 2
x = a[mi-1]
if x >= k:
ba = mi
continue
#print(mi)
dp = [False] * (k+1)
dp[0] = True
for i in range(n):
if ... | import sys
n, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
#print(a)
fr = 0
ba = n+1
def check(mi):
x = a[mi-1]
if x >= k:
return True
#print(mi)
dp = [False] * (k+1)
dp[0] = True
for i in range(n):
if i == mi-1:
c... | p03782 |
from bisect import bisect_left, bisect_right
def solve():
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
As.sort()
i = bisect_left(As, K)
Bs = As[:i]
M = len(Bs)
def isOK(x):
isFounds = [False] * K
isFounds[0] = True
for i... | from bisect import bisect_left, bisect_right
def solve():
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
As.sort()
i = bisect_left(As, K)
Bs = As[:i]
M = len(Bs)
def isOK(x):
bitset = 1<<(K-1)
for i, B in enumerate(Bs):
... | p03782 |
from bisect import bisect_left, bisect_right
from itertools import accumulate
def solve():
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
As.sort()
i = bisect_left(As, K)
Bs = As[:i]
M = len(Bs)
setSums = [{0}]
setSum = {0}
for B in Bs:
... | from bisect import bisect_left, bisect_right
from itertools import accumulate
def solve():
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
As.sort()
i = bisect_left(As, K)
Bs = As[:i]
M = len(Bs)
bitsets = [1<<(K-1)]
bitset = 1<<(K-1)
for ... | p03782 |
import bisect
def preliminary(k, aaa):
dp = [False] * k
dp[0] = True
curr_max = 0
fwd = []
for a in aaa:
for i in range(min(curr_max, k - a - 1), -1, -1):
if dp[i]:
dp[i + a] = True
fwd.append(dp[:])
curr_max += a
dp = [False]... | import bisect
def solve(k, aaa):
aaa = aaa[:bisect.bisect_left(aaa, k)]
dp = [False] * k
dp[0] = True
curr_max = 0
ans = len(aaa)
for i, a in reversed(list(enumerate(aaa))):
if curr_max + a >= k:
ans = i
f = True
for j in range(min(curr_max, k... | p03782 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
a.sort(reverse=True)
dp = [False] * (k)
dp[0] = True
min_n = 10**10
for i in a:
for j in range(k-1,-1,-1):
if(dp[j]):
if(j+i >= k):
min_n = i
else:
dp[j+i] = True
... | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
a.sort(reverse=True)
mask = (1<<k)-1
dp = 1
min_n = 10**10
for i in a:
if(i >= k):
min_n = i
continue
dp |= (dp<<i)
if(dp > mask):
min_n = i
dp &= mask
ans = 0
for i in a:
... | p03782 |
import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: list(map(int, stdin.readline().split()))
nl = lambda: list(map(int, stdin.readline().split()))
def solve():
n, k = list(map(int, input().split()))
a = list(map(int, input(... | n, k = list(map(int,input().split()))
a = [k+1 if x > k else x for x in map(int,input().split())]
a.sort()
lef = [1]*n
rig = [1]*n
mask = (1 << (k+1)) - 1
for i in range(n-1):
lef[i+1] = lef[i] | (lef[i] << a[i]) & mask
rig[-i-2] = rig[-i-1] | (rig[-i-1] << a[-i-1]) & mask
ok = -1
ng = n
while ng - ok > ... | p03782 |
import sys
stdin = sys.stdin
def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): re... | import sys
stdin = sys.stdin
def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): re... | p03782 |
# -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
from copy import deepcopy
N, K = inpl()
A = sorted(inpl())
S = []
s = 0
for a in A:
s += a
S.append(s)
A = A[::-1]
DP = [False for _ in range(K)]
DP[0] = 1
OK = [False for _ in range(N)]
for i, a in enumerate(A):
... | # -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
N, K = inpl()
A = sorted(inpl())
S = []
s = 0
for a in A:
s += a
S.append(s)
A = A[::-1]
DP = [True]+[False for _ in range(K-1)]
OK = [False for _ in range(N)]
for i, a in enumerate(A):
DP1 = [False] * K
i... | p03782 |
# -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
N, K = inpl()
A = sorted(inpl())
S = []
s = 0
for a in A:
s += a
S.append(s)
A = A[::-1]
DP = [True]+[False for _ in range(K-1)]
OK = [False for _ in range(N)]
for i, a in enumerate(A):
DP1 = [False] * K
i... | # -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
N, K = inpl()
A = sorted(inpl())
S = []
s = 0
for a in A:
s += a
S.append(s)
A = A[::-1]
DP = [True]+[False for _ in range(K-1)]
OK = [False for _ in range(N)]
for i, a in enumerate(A):
DP1 = [False for _ in ra... | p03782 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [[0]*(k + 1) for i in range(n + 1)]
dp[0][0] = 1
for i in range(n):
for j in range(k+1):
if j - a[i] < 0:
dp[i+1][j] = dp[i][j]
else:
dp[i+1][j] = dp[i][j] + dp[i][j - a[i]]
dp = dp[... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a = [0] + sorted(a) + [k]
def subset_sum(mid):
if a[mid] > k:
return False
li = a[0:mid] + a[mid+1:]
n = len(li)
dp = [False]*(k + 1)
dp[0] = True
for i in range(n):
for j in range(k+1)[... | p03782 |
N,K = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = [False] * N
able = [False] * (2*K+1)
able[0] = True
lis = [ [False] * N for i in range(2*K+1) ]
for i,na in enumerate(a):
if na >= K:
ans[i] = True
continue
nable = able.copy()
for j in ran... |
N,K = list(map(int,input().split()))
a = list(map(int,input().split()))
ans = N
q = 0
a.sort()
a.reverse()
nmax = 0
for i in range(N):
q += 1
if nmax + a[i] >= K:
ans -= q
q = 0
else:
nmax = nmax + a[i]
print (ans)
| p03782 |
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n,k,*a = list(map(int,read().split()))
a = [i for i in a if i<k]
n = len(a)
mask = (1<<k)-1
dpl = [1]
dp = 1
for i in a:
dp |= dp<<i
dp &= mask
dpl.append(dp)
dpr = [1]
dp = 1
for i ... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n,k,*a = list(map(int,read().split()))
a = [i for i in a if i<k]
n = len(a)
a.sort(reverse=True)
K = 2*k+1
mask = (1<<K)-1
dpl = [1]
dp = 1
for i in a:
dp |= (dp<<i)&mask
dpl.append(dp)
#... | p03782 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = [a for a in A if a <K]
N = len(A)
dpm = [[0]*(K+1) for _ in range(N+1)]
dpm[0][0] = 1
for i, a in enumerate(A):
for j in range(K, -1, -1):
dpm[i+1][j] = dpm[i][max(0, j-a)] + dpm[i][j]
r = 0
dp2 = 1
for i, a in enume... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = [a for a in A if a <K]
N = len(A)
#dpm = [+1) for _ in range(N+1)]
dpm = [0]*(N+1)
dpm[0] = 1<<(K-1)
for i, a in enumerate(A):
dpm[i+1] = dpm[i] | (dpm[i] >> a)
#print(bin(dpm[-1]))
r = 0
dp2 = 1
for i, a in enumerate(A[::-... | p03782 |
while True:
a, l = list(map(int, input().split()))
if((a|l) == 0): break
dic = {}
cnt = 0
dic[a] = cnt
while True:
cnt+=1
Sa = str(a)
Sa = [ x for x in list(Sa) if x is not '0']
if len(Sa) is 0: Sa.append('0')
Sa.sort()
S = int("".join(... | while True:
a, l = list(map(int, input().split()))
if((a|l) == 0): break
dic = {}
cnt = 0
dic[a] = cnt
while True:
cnt+=1
La = list(str(a).zfill(l))
La.sort()
a = int(''.join(La[::-1])) - int(''.join(La))
if a in dic:
print(dic[a], ... | p00761 |
def is_unique2(seq):
seen = []
unique_list = [x for x in seq if x not in seen and not seen.append(x)]
return len(seq) == len(unique_list)
while True:
iCount = 0
n = input().split()
if int(n[1]) == 0:
break
num = n.pop(0)
m = int(n[0])
numStr = list(num)
while ... | def is_unique2(seq):#後のwhile文でのループ脱出のため
seen = []
unique_list = [x for x in seq if x not in seen and not seen.append(x)]
return len(seq) == len(unique_list)
while True:
iCount = 0#問のiの部分の値です
n = input().split()
if int(n[1]) == 0:#入力の終わりを受けとった時breakする
break
a0 = n.pop(0)#a0は問... | p00761 |
N = int(eval(input()))
s = [0]*N
l = [0]*N
for i in range(N):
a, b = list(map(int, input().split()))
s[i] = (a, b)
for i in range(N):
c, d = list(map(int, input().split()))
l[i] = (c, d)
V = N*2 # 頂点数
MAX_V = V
G = [0]*MAX_V # グラフの隣接リスト表現
for i in range(MAX_V):
G[i] = []
mat... | N = int(eval(input()))
s = [0]*N
l = [0]*N
for i in range(N):
a, b = list(map(int, input().split()))
s[i] = (a, b)
for i in range(N):
c, d = list(map(int, input().split()))
l[i] = (c, d)
V = N*2 # 頂点数
MAX_V = V
G = [0]*MAX_V # グラフの隣接リスト表現
for i in range(MAX_V):
G[i] = []
m... | p03411 |
n = int(eval(input()))
ab = set(tuple(map(int, input().split())) for _ in range(n))
cd = sorted(tuple(map(int, input().split())) for _ in range(n))
ab |= {(-1, -1)}
for c, d in cd:
tmp = max((b, a) for a, b in ab if (a < c and b < d))[::-1]
if tmp != (-1, -1):
ab.remove(tmp)
print((n - (len(ab... | n = int(eval(input()))
ab = set(tuple(map(int, input().split())) for _ in range(n))
cd = sorted(tuple(map(int, input().split())) for _ in range(n))
ab |= {(-1, -1)}
for c, d in cd:
tmp = max((b, a) for a, b in ab if (a < c and b < d))
if tmp != (-1, -1):
ab.remove(tmp[::-1])
print((n - (len(ab... | p03411 |
n = int(eval(input()))
ab = set(tuple(map(int, input().split())) for _ in range(n))
cd = sorted(tuple(map(int, input().split())) for _ in range(n))
ab |= {(-1, -1)}
ans = 0
for c, d in cd:
tmp = max((b, a) for a, b in ab if (a < c and b < d))
if tmp != (-1, -1):
ab.remove(tmp[::-1])
a... | n = int(eval(input()))
ab = set(tuple(map(int, input().split())) for _ in range(n))
cd = sorted(tuple(map(int, input().split())) for _ in range(n))
ab |= {(-1, -1)}
ans = 0
for c, d in cd:
tmp = max((b, a) for a, b in ab if (a < c and b < d))
if tmp != (-1, -1):
ab.remove(tmp[::-1])
a... | p03411 |
N = int(eval(input()))
R = [tuple(map(int, input().split())) for _ in range(N)]
B = [tuple(map(int, input().split())) for _ in range(N)]
dp = {}
def check(v, p):
return p & (1 << v)
def visit(v, p):
return p ^ (1 << v)
def count(p):
return bin(p).count('1')
def solve(i, p):
... | N = int(eval(input()))
R = [tuple(map(int, input().split())) for _ in range(N)]
B = [tuple(map(int, input().split())) for _ in range(N)]
R.sort(reverse=True, key=lambda k: k[1])
B.sort()
p = []
q = []
for c, d in B:
for a, b in R:
if (a, b) in p:
continue
if a < c and b ... | p03411 |
N=int(eval(input()))
a=[0 for i in range(N)]
b=[0 for i in range(N)]
c=[0 for i in range(N)]
d=[0 for i in range(N)]
for i in range(N):
a[i], b[i] = list(map(int, input().split()))
for i in range(N):
c[i], d[i] = list(map(int, input().split()))
m=[[0 for i in range(N)] for i in range(N)]
s=[set() for ... | N=int(eval(input()))
r=[(0,0) for i in range(N)]
b=[(0,0) for i in range(N)]
for i in range(N):
x,y=list(map(int,input().split()))
r[i]=(x,y)
for i in range(N):
x,y=list(map(int,input().split()))
b[i]=(x,y)
b.sort()
ru=[0 for i in range(N)]
ans=0
for i in range(N):
k=-1
for j in ... | p03411 |
#!python3
INF = 10 ** 15
# input
N = int(eval(input()))
a, b, c, d = [None] * N, [None] * N, [None] * N, [None] * N
for i in range(N):
a[i], b[i] = list(map(int, input().split()))
for i in range(N):
c[i], d[i] = list(map(int, input().split()))
class MaxFlow():
def __init__(self, n):
... | #!python3
INF = 10 ** 15
# input
N = int(eval(input()))
a, b, c, d = [None] * N, [None] * N, [None] * N, [None] * N
for i in range(N):
a[i], b[i] = list(map(int, input().split()))
for i in range(N):
c[i], d[i] = list(map(int, input().split()))
class MaxFlow():
def __init__(self, n):
... | p03411 |
N=int(eval(input()))
RED=[tuple(map(int, input().split())) for _ in range(N)]
BLUE=[tuple(map(int, input().split())) for _ in range(N)]
RED.sort(key=lambda x:x[1], reverse=True)
BLUE.sort(key=lambda x:x[0])
ans=0
r_used=[False]*N
for b in BLUE:
for j,r in enumerate(RED):
if r_used[j]: continue
... | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, AB, CD):
ans = 0
AB.sort(key=lambda x: x[0], reverse=True)
for a, b in AB:
CD.sort(key=lambda x: x[1])
idx = 0
while idx < len(CD):
c, d = CD[idx]
if a < c and b < d:
... | p03411 |
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return list(map(int,input().split()))
def lmp(): return list(map(int,inp... | a=int(eval(input()))
print((a+a**2+a**3)) | p02621 |
#!/usr/bin/python3
a = int(eval(input()))
ans = a + a**2 + a**3
print(ans) | a = int(eval(input()));print((a + a**2 + a**3)) | p02621 |
a = int(eval(input()))
print((a + a * a + a * a * a)) | a = int(eval(input()))
print((a + a ** 2 + a ** 3)) | p02621 |
a=int(eval(input()))
print((a+(a**2)+(a**3))) | a=int(eval(input()))
print((a+a**2+a**3)) | p02621 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
def main():
N = int(eval(input()))
print((N+N*N+N*N*N))
if __name__ == '__main__':
main() | #!/usr/bin python3
# -*- coding: utf-8 -*-
def main():
a = int(eval(input()))
print((a+a*a+a*a*a))
if __name__ == '__main__':
main() | p02621 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.st... | import sys
def I(): return int(sys.stdin.readline().rstrip())
a = I()
print((a+a**2+a**3)) | p02621 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: list(map(int, read().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
... | a=int(eval(input()))
print((a+a*a+a**3)) | p02621 |
N = 10**7
M = 10**5
arr = list(range(M))
def f(x):
return x
for i in range(N):
b = arr[i % M]
b = f(b)
a = int(eval(input()))
print((a + a**2 + a**3))
| N = 10**7
# M = 10**5
# arr = list(range(M))
# def f(x):
# return x
for i in range(N):
pass
# 答え
a = int(eval(input()))
print((a + a**2 + a**3))
| p02621 |
N = 10**7
M = 10**5
arr = list(range(M))
for i in range(N):
t = arr[i % M]
# 答え
a = int(eval(input()))
print((a + a**2 + a**3))
| N = 10**7
arr = [0]
for i in range(N):
t = arr[0]
# 答え
a = int(eval(input()))
print((a + a**2 + a**3))
| p02621 |
N = 10**7
def f(x):
return x
M = 10**5
arr = list(range(M))
for i in range(N):
t = (i + i * i - i) % M # 四則演算
b = arr[t] # 配列ランダムアクセス
b = f(b) # 関数呼び出し
# 答え
a = int(eval(input()))
print((a + a**2 + a**3))
| N = 10**6
def f(x):
return x
M = 10**5
arr = list(range(M))
for i in range(N):
t = (i + i * i - i) % M # 四則演算
b = arr[t] # 配列ランダムアクセス
b = f(b) # 関数呼び出し
# 答え
a = int(eval(input()))
print((a + a**2 + a**3))
| p02621 |
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
def inp(): return int(eval(input()))
def inpm(): return list(map(int,input().sp... | a = int(eval(input()))
print((a+a**2+a**3)) | p02621 |
a = int(eval(input()))
print((a + a ** 2 + a ** 3)) | #!/usr/bin/env pypy3
def main():
a = int(eval(input()))
print((a + a ** 2 + a ** 3))
if __name__ == '__main__':
main()
| p02621 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
a = int(readline())
print((a + a ** 2 + a ** 3))
if __name__ == '__main__':
main()
| a = int(eval(input()))
print((a + a ** 2 + a ** 3)) | p02621 |
a = int(eval(input()))
print((a + (a * a) + (a * a * a)))
| a = int(eval(input()))
print((a + a**2 + a**3))
| p02621 |
a = int(eval(input()))
print((int(a+a**2+a**3)))
|
a = int(eval(input()))
print((a+a**2+a**3))
| p02621 |
a = int(eval(input()))
ans = a + a**2 + a**3
print(ans) | a = int(eval(input()))
print((a+a**2+a**3)) | p02621 |
a = int(eval(input()))
print((a+a**2+a**3))
| a = int(eval(input()))
print((a + a*a + a**3))
| p02621 |
a=int(eval(input()))
print((a+a**2+a**3))
| import math
a=int(eval(input()))
print((round((a*(a-(-1+math.sqrt(3)*(1j))/2)*(a-(-1-math.sqrt(3)*(1j))/2)).real))) | p02621 |
num = int(eval(input()))
result = num + num**2 + num**3
print(result) | a=int(eval(input()))
print((a+a**2+a**3)) | p02621 |
a = int(eval(input()))
print((a+a**2+a**3)) | a = int(eval(input()))
if a == 1:
print((3))
elif a == 2:
print((14))
elif a == 3:
print((39))
elif a == 4:
print((84))
elif a == 5:
print((155))
elif a == 6:
print((258))
elif a == 7:
print((399))
elif a == 8:
print((584))
elif a == 9:
print((819))
elif a == 10:
print((1110))
| p02621 |
def main():
a = int(eval(input()))
ret = a
ret += a * a
ret += a * a * a
print(ret)
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
print((N + N * N + N * N * N))
if __name__ == '__main__':
main()
# import sys
# input = sys.stdin.readline
#
# sys.setrecursionlimit(10 ** 7)
#
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
# while abs(ok... | p02621 |
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return... | import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return... | p02621 |
a = int(eval(input()))
print((a+a*a+a*a*a)) | a = int(eval(input()))
print((a+a**2+a**3)) | p02621 |
a = int(eval(input()))
print((a+a*a+a**3)) | a = int(eval(input()))
print((a + a*a + a*a*a)) | p02621 |
x=int(eval(input()))
print((x+x*x+x*x*x)) | a=int(eval(input()))
print((a+a**2+a**3)) | p02621 |
a = int(eval(input()))
result = a + (a*a) + (a*a*a)
print(result) | a = int(eval(input()))
result = a + (a**2) + (a**3)
print(result) | p02621 |
a = int(eval(input()))
print((a*((a+1)*(a+1)-a))) | a = int(eval(input()))
print((a+a*a+a*a*a)) | p02621 |
number = int(eval(input()))
print((number + number**2 + number**3)) | num = int(eval(input()))
print((num +num**2+ num**3)) | p02621 |
a=int(eval(input()))
print((int(a+a**2+a**3))) | a=int(eval(input()))
print((a+a**2+a**3)) | p02621 |
a = int(eval(input()))
b = [3, 14, 39, 84, 155, 258, 399, 584, 819, 1110]
print((b[a-1])) | def main():
a = int(eval(input()))
print((int(a+a*a+a**3)))
if __name__ == "__main__":
main() | p02621 |
def main():
a = int(eval(input()))
print((int(a+a*a+a**3)))
if __name__ == "__main__":
main() | a = int(eval(input()))
print((a*(a*a+a+1))) | p02621 |
s = int(input())
print(s + s ** 2 + s ** 3)
|
s = input()
s = int(s)
print(s + s ** 2 + s ** 3)
| p02621 |
a=int(eval(input()))
s=a+a**2+a**3
print(s) | a=int(eval(input()))
print((a+a**2+a**3)) | p02621 |
a = int(eval(input()))
b = a**2
c = a**3
print((a+b+c)) | a = int(eval(input()))
print((a+a**2+a**3)) | p02621 |
a = int(eval(input()))
print((a + a * a + a * a * a)) | N = int(eval(input()))
print((N + N*N + N*N*N)) | p02621 |
a = eval(input())
b = int(a)
print((b+b**2+b**3))
| a=int(eval(input()))
print((a+a**2+a**3)) | p02621 |
a = int(eval(input()))
a2 = a*a
a3 = a2 * a
print((a + a2 + a3))
| a = int(eval(input()))
print((a+a**2+a**3)) | p02621 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")
def input():
return sys.stdin.readline().strip()
def INT():
return int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST():
return list(map(int, input().split()))
def... | #!/usr/bin/env python3
import sys
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def ZIP(n): return list(zip(*(MAP() for _ in range(n))))
def main():
sys.setrecursion... | p02621 |
a = int(eval(input()))
print(((a**3)+(a**2)+a)) | a = int(eval(input()))
print((a**3+a**2+a)) | p02621 |
a,b=list(map(int,input().split()))
if a>b:
print((str(b)*a))
if a<=b:
print((str(a)*b))
| a,b=list(map(int,input().split()))
print((str(min(a,b))*max(a,b))) | p02790 |
a,b=input().split();print(([b*int(a),a*int(b)][a<b])) | a,b=input().split();print((min(b*int(a),a*int(b)))) | p02790 |
def main():
a, b = input().split(" ")
i = int(a * int(b))
j = int(b * int(a))
numbers = [k for k in range(1, (max(i, j) + 1))]
i_index = numbers.index(i)
j_index = numbers.index(j)
if i_index > j_index:
print(i)
else:
print(j)
if __name__ == '__main__':
... | def main():
a, b = list(map(int, input().split(" ")))
if a < b:
print((str(a) * b))
else:
print((str(b) * a))
if __name__ == '__main__':
main() | p02790 |
def main():
a, b = input().split()
aa = a*int(b)
bb = b*int(a)
if aa < bb:
return aa
return bb
if __name__ == '__main__':
print((main()))
| def main():
a, b = input().split()
s = a * int(b)
t = b * int(a)
if s < t:
return s
return t
if __name__ == '__main__':
print((main()))
| p02790 |
def main():
a, b = input().split()
s = a * int(b)
t = b * int(a)
if s < t:
return s
return t
if __name__ == '__main__':
print((main()))
| def main():
a, b = list(map(int, input().split()))
s = str(a) * b
t = str(b) * a
if s < t:
return s
return t
if __name__ == '__main__':
print((main()))
| p02790 |
a,b=list(map(str,input().split()))
if int(a*int(b))>=int(b*int(a)):
print((int(a*int(b))))
else:
print((int(b*int(a)))) | a,b=list(map(int,input().split()))
print((str(min(a,b))*max(a,b))) | p02790 |
a_str, b_str = input().split()
a = int(a_str)
b = int(b_str)
A = a_str*b
B = b_str*a
print((min(A, B))) | a, b = list(map(int, input().split()))
if a > b:
print((str(b) * a))
elif a < b:
print((str(a) * b))
else:
print((str(a) * a)) | p02790 |
a, b = list(map(int, input().split()))
ans = min(str(a) * b, str(b) * a)
print(ans) | a, b = list(map(int, input().split()))
x = str(a) * b
y = str(b) * a
ans = min(x, y)
print(ans) | p02790 |
a, b = input().split()
ab, ba = a*int(b), b*int(a)
print((ab if ab < ba else ba)) | a, b = input().split()
print((a*int(b) if a < b else b*int(a))) | p02790 |
a, b = list(map(int, input().split()))
str_a = str(a) * b
str_b = str(b) * a
if str_a<str_b:
print(str_a)
else:
print(str_b)
| # Problem B - Comparing Strings
# input process
a, b = input().split()
str_a = a * int(b)
str_b = b * int(a)
# output process
if str_a>=str_b:
print(str_b)
else:
print(str_a)
| p02790 |
a,b=input().split()
e=[str(a*int(b)),str(b*int(a))]
e.sort()
print((e[0]))
| a=sorted(list(map(int,input().split())))
print((str(a[0])*a[1])) | p02790 |
a,b=list(map(int,input().split()))
if a>=b:
print((str(b)*a))
else:
print((str(a)*b)) | a,b=input().split()
if a<b:
print((a*int(b)))
else:
print((b*int(a))) | p02790 |
A,B=map(int,input().split())
if A<B:
for i in range (B):
print(A,end="")
print()
else:
for i in range (A):
print(B,end="")
print()
| A,B=list(map(int,input().split()))
C=int(str(A)*B)
D=int(str(B)*A)
E=[C,D]
F=sorted(E)
print((int(F[1]))) | p02790 |
a,b = list(map(int,input().split()))
a_l = ""
b_l = ""
for i in range(b):
a_l += str(a)
for j in range(a):
b_l += str(b)
if a>b:
print(b_l)
elif b<a:
print(a_l)
else:
print(a_l) | a,b = list(map(int,input().split()))
k = str(a)
l = str(b)
X = k*b
Y = l*a
if (X < Y):
print(X)
else:
print(Y) | p02790 |
a,b = list(map(int,input().split()))
if a>=b:
print((str(b)*a))
else:
print((str(a)*b)) | a,b=list(map(int,input().split()))
if a==b:
print((str(a)*b))
else:
print((str(min(a,b))*max(a,b)))
| p02790 |
a,b=input().split()
print((min(a*int(b),b*int(a)))) | a, b = input().split()
print((a*int(b) if a < b else b*int(a))) | p02790 |
a, b = input().split()
print((a*int(b) if a < b else b*int(a))) | a, b = input().split()
print((min(a*int(b), b*int(a)))) | p02790 |
a,b = list(map(int,input().split()))
words = []
a_word = ""
b_word = ""
for i in range(a):
b_word += str(b)
for i in range(b):
a_word += str(a)
words.append(a_word)
words.append(b_word)
words.sort()
print((words[0])) | a,b = list(map(int,input().split()))
word = ""
for i in range(max(a,b)):
word += str(min(a,b))
print(word)
| p02790 |
a, b = input().split()
print((a*int(b) if a<=b else b*int(a))) | A, B = input().split()
print((min(A*int(B), B*int(A)))) | p02790 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
a, b = list(map(int, input().rstrip('\n').split()))
ls = []
ls.append(str(b) * a)
ls.append(str(a) * b)
ls.sort()
print((ls[0]))
if __name__ == '__main__':
solve()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
a, b = list(map(str, readline().rstrip().decode('utf-8').split()))
if a * int(b) < b * int(a):
print((a * int(b)))
else:
print((b * int(a)))
if __name__ == '__main__':
solve()
| p02790 |
a, b = list(map(int, input().split()))
a_l = []
b_l = []
for i in range(a):
a_l += str(b)
for i in range(b):
b_l += str(a)
a_l = ''.join(a_l)
b_l = ''.join(b_l)
all = []
all.append(a_l)
all.append(b_l)
all.sort()
print((all[0])) | a, b = list(map(int, input().split()))
list_a = []
list_b = []
for i in range(a):
list_a.append(str(b))
for i in range(b):
list_b.append(str(a))
A = ''.join(list_a)
B = ''.join(list_b)
if a >= b:
print(A)
else:
print(B) | p02790 |
a = [int(i) for i in input().split()]
if (a[0] <= a[1]):
print((str(a[0])*a[1]))
elif (a[1] < a[0]):
print((str(a[1])*a[0]))
| a,b=list(map(int,input().split()))
print((str(min(a,b))*max(a,b))) | p02790 |
# ABC 152 B
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()))
a,b=nm()
s=''
t=''
for i in range(b):
s+=str(a)
for i in range(a):
t+=str(b)
l=[]
l.app... | a,b=list(map(int,input().split()))
l=[]
l.append(str(a)*b)
l.append(str(b)*a)
l.sort()
print((l[0])) | p02790 |
args = int(input().rstrip())
def snuke(n):
s = 0
while n:
s += n % 10
n //= 10
return s
def find_snuke(args):
result = []
i = 1
while len(result) < args:
push = True
p = 0
for power in range(0,len(str(i))):
if((i+10**power)/sn... | args = int(input().rstrip())
def snuke(n):
s = 0
while n:
s += n % 10
n //= 10
return s
def find_snuke(args):
result = []
i = 1
while len(result) < args:
push = True
p = 0
for power in range(0,len(str(i))):
if((i+10**power)/sn... | p03320 |
K = int(input())
S = lambda n: sum(map(int,str(n)))
R = lambda n: n/S(n)
arr = []
for i in range(1,10000):
for j in range(1,15):
arr.append(int(str(i) + '9'*j))
arr.sort(reverse=True)
min_r = arr[0]
snukes = []
for a in arr:
r = R(a)
if r < min_r:
min_r = r
snukes.a... | K = int(input())
S = lambda n: sum(map(int,str(n)))
R = lambda n: n/S(n)
arr = []
for i in range(1,1000):
for j in range(1,15):
arr.append(int(str(i) + '9'*j))
arr.sort(reverse=True)
min_r = arr[0]
snukes = []
for a in arr:
r = R(a)
if r < min_r:
min_r = r
snukes.ap... | p03320 |
K = int(input())
S = lambda n: sum(map(int,str(n)))
R = lambda n: n/S(n)
arr = []
for i in range(1,1000):
for j in range(1,15):
arr.append(int(str(i) + '9'*j))
arr.sort(reverse=True)
min_r = arr[0]
snukes = []
for a in arr:
r = R(a)
if r < min_r:
min_r = r
snukes.ap... | K = int(input())
S = lambda n: sum(map(int,str(n)))
R = lambda n: n/S(n)
arr = []
for i in range(1,200):
for j in range(1,15):
arr.append(int(str(i) + '9'*j))
arr.sort(reverse=True)
min_r = arr[0]
snukes = []
for a in arr:
r = R(a)
if r < min_r:
min_r = r
snukes.app... | p03320 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
def S(k):
return sum(int(x) for x in str(k))
def T(k):
return k / S(k... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
def T(k):
orig_k = k
sk = 0
while k > 0:
sk += k % 10
... | p03320 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
def T(k):
orig_k = k
sk = 0
while k > 0:
sk += k % 10
... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
def T(k):
orig_k = k
sk = 0
while k > 0:
sk += k % 10
... | p03320 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
def T(k):
orig_k = k
sk = 0
while k > 0:
sk += k % 10
... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
def T(k):
orig_k = k
sk = 0
while k > 0:
sk += k % 10
... | p03320 |
# _*_ coding:utf-8 _*_
# Atcoder_Beginners_Contest083-B
# https://atcoder.jp/contests/abc080/tasks/abc080_b
def sumKeta(number):
number2Str = str(number)
numberLength=len(number2Str)
thisNumberSum = 0
ketaRange = list(range(0,numberLength,1))
for i in ketaRange:
thisNumberKeta = int(number2Str[i])
... | # Problem: https://atcoder.jp/contests/abc080/tasks/abc080_b
# Python 1st Try
import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(in... | p03502 |
N=int(eval(input()))
N_list=list(str(N))
if len(N_list)==1:
M=int(N_list[0])
if N%M==0:
print("Yes")
else:
print("No")
elif len(N_list)==2:
I=int(N_list[0])+int(N_list[1])
if N%I==0:
print("Yes")
else:
print("No")
elif len(N_list)==3:
U=int(N_... | N=int(eval(input()))
f_x=sum(map(int,str(N)))
if N%f_x==0:
print("Yes")
else:
print("No") | p03502 |
n = int(eval(input()))
def sum_digits(n):
result = n % 10
while n // 10 != 0:
n //= 10
result += (n % 10)
return result
if n % sum_digits(n) == 0:
print("Yes")
else:
print("No")
| def calculate_summary_of_digits(n):
result = 0
while n != 0:
result += (n % 10)
n //= 10
return result
n = int(eval(input()))
sum_of_digits = calculate_summary_of_digits(n)
print(("Yes" if n % sum_of_digits == 0 else "No"))
| p03502 |
N=int(eval(input()))
N_sum=list(str(N))
fN=0
for n in range(len(N_sum)):
fN+=int(N_sum[n])
if N%fN==0:
print('Yes')
else:
print('No')
| n = int(eval(input()))
x = sum([int(s) for s in str(n)])
print(('Yes' if n%x == 0 else 'No'))
| p03502 |
n=input()
fx=0
for i in n:
fx+=int(i)
print('Yes') if int(n)%fx==0 else print('No')
| n=i=int(input())
sum=0
while i/10>0:
sum+=int(i%10)
i=int(i/10)
print('Yes') if n%sum==0 else print('No')
| p03502 |
while 1:
k=int(eval(input()))
if k==0:break
print((sum(map(int,input().split()))//(k-1))) | while 1:
k=int(eval(input()))-1
if k<0:break
print((sum(map(int,input().split()))//k)) | p00613 |
import sys
def solve():
while(1):
n = int(input())
if n == 0:
break
score_a, score_b = 0, 0
while(n > 0):
a, b = list(map(int, input().split()))
if a > b:
score_a += a + b
elif b > a:
score_b += a + b
else:
score_a += a
sco... |
def solve():
while(1):
n = int(input())
if n == 0:
break
score_a, score_b = 0, 0
while(n > 0):
a, b = list(map(int, input().split()))
if a > b:
score_a += a + b
elif b > a:
score_b += a + b
else:
score_a += a
score_b += b
... | p00423 |
import sys
def main():
n, s = sys.stdin.read().split()
n = int(n)
left, right = 0, 0
for char in s:
if char == '(':
right += 1
# これ以前に出現している')'の数が'('の数より多い可能せがあるのでleftを削ることはできないため、ペアになる可能性としての')'を追加
elif char == ')':
if right:
... | import sys
n = int(sys.stdin.readline().rstrip())
s = sys.stdin.readline().rstrip()
def main():
l = r = 0
for char in s:
if char == '(':
r += 1
elif char == ')':
if r:
r -= 1
else:
l += 1
return '(' * l + ... | p03696 |
eval(input())
s = input().strip()
ans = s
depth = 0
for c in s:
if c == '(':
depth += 1
else:
if depth:
depth -= 1
else:
ans = '(' + ans
ans += ')' * depth
print(ans)
| eval(input())
s = input().strip()
stock, depth = 0, 0
for c in s:
if c == '(':
depth += 1
else:
if depth:
depth -= 1
else:
stock += 1
print(('(' * stock + s + ')' * depth))
| p03696 |
N = int(eval(input()))
S = input().strip()
S1 = S
cur = 0
for i in range(len(S)):
if S[i]=="(":
cur += 1
else:
cur -= 1
if cur<0:
S1 = "("+S1
cur += 1
S1 = S1+")"*cur
print(S1) | N = int(eval(input()))
S = input().strip()
while True:
lv = 0
lmin = len(S)
for i in range(len(S)):
if S[i]=="(":
lv += 1
else:
lv -= 1
lmin = min(lmin,lv)
if lmin<0:
S = "("*(-lmin)+S
else:break
lv = 0
for i in range(len(S)):
... | p03696 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.