input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from math import ceil
from bisect import bisect_left
def solve(n, h):
a = []
b = []
for i in range(n):
ai, bi = list(map(int, input().split()))
a.append(ai)
b.append(bi)
a.sort()
b.sort()
if n == 1:
ans = ceil((h-b[n-1])/a[n-1])+1
... | from math import ceil
from bisect import bisect_left
def solve(n, h):
a = []
b = []
for i in range(n):
ai, bi = list(map(int, input().split()))
a.append(ai)
b.append(bi)
amax = max(a)
b.sort()
if n == 1:
ans = ceil((h-b[n-1])/amax)+1
e... | p03472 |
n,h=list(map(int,input().split()))
a=[]
b=[]
for _ in range(n):
a_i,b_i=list(map(int,input().split()))
a.append(a_i)
b.append(b_i)
import bisect,math
b=sorted(b)
index = bisect.bisect_left(b,max(a))
cnt=0
for i in range(n-1,-1,-1):
if i>=index:
h-=b[i]
cnt+=1
e... | n,h=list(map(int,input().split()))
b = []
t = []
for _ in range(n):
c,d = list(map(int,input().split()))
b.append(c)
t.append(d)
b_max = max(b)
t =sorted(t)
from bisect import bisect_right
from math import ceil
index = bisect_right(t,b_max)
ans=0
for i in range(n-1,index-1,-1):
h... | p03472 |
import math
n,h = list(map(int, input().split()))
al = []
bl = []
for _ in range(n):
a,b = list(map(int, input().split()))
al.append((a,'swing'))
bl.append((b,'throw'))
abl = al + bl
abl.sort(reverse=True)
remain_h = h
ans = 0
for v in abl:
damage, command = v
if command == 'swin... | n,h = list(map(int, input().split()))
al = []
bl = []
for _ in range(n):
a,b = list(map(int, input().split()))
al.append(a)
bl.append(b)
al.sort(reverse=True)
bl.sort(reverse=True)
amax = al[0]
ans = 0
rem = h
for b in bl:
if b >= amax:
rem -= b
ans += 1
else:
... | p03472 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | p03472 |
import math
n, h = list(map(int, input().split()))
sl = 0
th = []
for i in range(n):
a, b = list(map(int, input().split()))
sl = max(sl, a)
th.append(b)
th.sort()
th_damage = th.pop()
turn = 0
while (h > 0):
if th_damage > sl:
h -= th_damage
if len(th) != 0:
... | # 16:15
import sys
input = lambda: sys.stdin.readline().rstrip()
import math
n, h = list(map(int, input().split()))
sl = 0
th = []
for i in range(n):
a, b = list(map(int, input().split()))
sl = max(sl, a)
th.append(b)
th.sort()
th_damage = th.pop()
turn = 0
while (h > 0):
if th_damage >... | p03472 |
n, h = list(map(int, input().split()))
a = []
b = []
for i in range(n):
ai, bi = list(map(int, input().split()))
a.append(ai)
b.append(bi)
b.append(0)
b = sorted(b, reverse=True)
count = 0
while True:
if max(b) < max(a):
count += -(-h // max(a))
break
else:
h... | n, h = list(map(int, input().split()))
a = []
b = []
for i in range(n):
ai, bi = list(map(int, input().split()))
a.append(ai)
b.append(bi)
b.append(0)
a2 = sorted(a, reverse=True)
b2 = sorted(b, reverse=True)
count = 0
while True:
if h <= 0:
break
elif b2[0] <= a2[0]:
... | p03472 |
from math import ceil
N, H = list(map(int, input().split()))
a, b = [], []
for _ in range(N):
ta, tb = list(map(int, input().split()))
a.append(ta)
b.append(tb)
Ma = max(a)
b = sorted([x for x in b if x > Ma], reverse=True)
lb = len(b)
t = 0
while t < lb:
H -= b[t]
t += 1
if ... | def main():
import sys
input = sys.stdin.readline
N, H = list(map(int, input().split()))
bs = []
a_mx = -1
for _ in range(N):
a, b = list(map(int, input().split()))
a_mx = max(a_mx, a)
bs.append(b)
bs = [b for b in bs if b > a_mx]
bs.sort(reverse=... | p03472 |
from functools import reduce
from math import ceil
# 入力
N, H = list(map(int, input().split()))
a, b = list(zip(*(list(map(int, input().split())) for _ in range(N))))
# 投げるべき刀を強力なものから投げる。その後、振るべき刀を降り続ける。
m = max(a)
c = sorted([x for x in b if x > m], reverse=True)
ans = (
reduce(
lambda acc, e:... | from functools import reduce
from math import ceil
# 入力
N, H = list(map(int, input().split()))
a, b = list(zip(*(list(map(int, input().split())) for _ in range(N))))
# 投げるべき刀を強力なものから投げる。その後、振るべき刀を降り続ける。
m = max(a)
c = sorted(
[x for x in b if x > m],
reverse=True
)
ans, _ = (
reduce(
... | p03472 |
N,H=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(N)]
B=[]
C=[]
for a,b in A:
B.append(a)
C.append(b)
D=sorted(B)[::-1]
F=[]
for i in C:
if max(B)<i:
F.append(i)
cnt=0
for i in F:
H-=i
cnt+=1
if H<=0:
print(cnt)
exit()
print((cnt-((-H)//D[0]))... | N,H=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(N)]
B=[]
C=[]
for a,b in A:
B.append(a)
C.append(b)
D=sorted(B)[::-1]
b=D[0]
F=[]
for i in C:
if b<i:
F.append(i)
G=sorted(F)[::-1]
cnt=0
for i in G:
H-=i
cnt+=1
if H<=0:
print(cnt)
exit()
pr... | p03472 |
# coding: utf-8
from math import ceil
N, H = list(map(int, input().split()))
li = []
atop = 0
for _ in range(N):
a, b = list(map(int, input().split()))
atop = max(atop, a)
li.append([a, b])
li.sort(key=lambda x: x[1], reverse=True)
# print(li)
ans = ceil(H/atop)
cnt = 0
for i in range(N):
... | # coding: utf-8
from math import ceil
N, H = list(map(int, input().split()))
li = []
atop = 0
for _ in range(N):
a, b = list(map(int, input().split()))
atop = max(atop, a)
li.append(b)
li.sort(reverse=True)
# print(li)
ans = ceil(H/atop)
cnt = 0
for i in range(N):
H -= li[i]
cnt += 1
... | p03472 |
from math import ceil
N, H = list(map(int, input().split()))
sword = [[int(x) for x in input().split()] for _ in range(N)]
max_swing = max(sword, key=lambda x:x[0])[0]
attack = 0
# 投げで攻撃
for i in sorted(sword, key=lambda x: x[1], reverse=True):
if max_swing < i[1]:
H -= i[1]
attack += 1
if... | # 振るのは最強のやつだけ
# 投げるのは強い順
N,H = list(map(int,input().split()))
AB = [[int(x) for x in input().split()] for _ in range(N)]
A,B = list(zip(*AB))
a = max(A) # 振る
B = [b for b in B if b > a] # 投げる価値あり
B.sort(reverse = True)
attack_cnt = 0
for b in B:
if H <= 0:
break
attack_cnt += 1
H -= b
... | p03472 |
# -*- coding: utf-8 -*-
from bisect import bisect_left
N, H = list(map(int, input().split()))
A, B = [0]*N, [0]*N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
a_max = max(A)
B.sort()
# 一番強い振る刀より弱い投げる刀はいらない
B2 = list(reversed(B[bisect_left(B, a_max):]))
cnt = 0
# 投げるだけで倒せるか
if ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03472 |
N,H=list(map(int,input().split()))
L=[list(map(int,input().split())) for _ in range(N)]
A=max(a for a,_ in L)
B=sorted(b for _,b in L if b>A)
c=0
while B and H>0:
H-=B.pop()
c+=1
print((c-(-max(0,H)//A))) | N,H=list(map(int,input().split()))
L=[list(map(int,input().split()))for _ in[0]*N]
A=max(a[0]for a in L)
B=sorted(b for _,b in L if b>A)
c=0
while B and H>0:
H-=B.pop()
c+=1
print((c-(-max(0,H)//A))) | p03472 |
import math
inn = [int(x) for x in input().split()]
aa = []
bb = []
for i in range(inn[0]):
tmp = [int(x) for x in input().split()]
aa.append(tmp[0])
bb.append(tmp[1])
count = 0
tot = 0
ba = list(filter((lambda x: x > max(aa)), bb))
if sum(ba) == inn[1]:
print((len(ba)))
exit()
eli... | import math
inn = [int(x) for x in input().split()]
aa = []
bb = []
for i in range(inn[0]):
tmp = [int(x) for x in input().split()]
aa.append(tmp[0])
bb.append(tmp[1])
maxaa = max(aa)
ba = [x for x in bb if x > maxaa]
sumba = sum(ba)
lenba = len(ba)
if sumba == inn[1]:
print(lenba)
... | p03472 |
# ABC 085 D
import bisect, math
N, H = list(map(int, input().split()))
a = []
b = []
for k in range(N):
x, y = list(map(int, input().split()))
a.append(x)
b.append(y)
a = sorted(a)
b = sorted(b)
l = N - bisect.bisect_left(b,a[-1])
b = b[::-1]
ans = 0
for k in range(l):
ans += 1
H... | import math, sys
def input():
return sys.stdin.readline()[:-1]
def main():
N, H = list(map(int,input().split()))
A = [0 for k in range(N)]
B = [0 for k in range(N)]
for k in range(N):
a, b = list(map(int,input().split()))
A[k] = a
B[k] = b
A = sorted(A)[::-... | p03472 |
from itertools import accumulate
from bisect import bisect_left
from math import ceil
N,H = list(map(int, input().split()))
AB = []
for _ in range(N):
AB.append(tuple(map(int, input().split())))
# A昇順、B降順にソート
AB.sort(key=lambda x: (x[0], -x[1]))
# 最後の刀を装備する
equip = AB.pop()
# a_max < b なる刀を集める
b... | from itertools import accumulate
from bisect import bisect_left
from math import ceil
N,H = list(map(int, input().split()))
A = []
B = []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
# 最も強いaを探す
a_max = max(A)
# それ以上のbを探す
b_strong = []
for b in B:
... | p03472 |
from itertools import accumulate
from bisect import bisect_left
from math import ceil
N,H = list(map(int, input().split()))
A = []
B = []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
# 最も強いaを探す
a_max = max(A)
# それ以上のbを探す
b_strong = []
for b in B:
... | 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.rea... | p03472 |
from bisect import bisect_right
N,H = list(map(int,input().split()))
A = []
B = []
for _ in range(N):
a,b = list(map(int,input().split()))
A.append(a)
B.append(b)
A = sorted(A,reverse=True)
B = sorted(B)
a = A[0]
ind = bisect_right(B,a)
cnt = 0
flag = 0
for i in range(N-1,ind-1,-1):
H -= ... | import math
N,H = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(N)]
a = 0
for i in range(N):
if A[i][0]>a:
a = A[i][0]
B = []
for i in range(N):
if A[i][1]>a:
B.append(A[i][1])
B = sorted(B,reverse=True)
totB = sum(B)
if totB>=H:
flag = 0
... | p03472 |
import math
n, h = list(map(int, input().split()))
a, b = [0] * n, [0] * n
for i in range(n):
x, y = list(map(int, input().split()))
a[i], b[i] = x, y
b.sort(reverse = True)
ans = 0
for i in range(n):
if b[i] < max(a):
break
h -= b[i]
ans += 1
if h <= 0:
break
if... | import math
n, h = list(map(int, input().split()))
b = [0] * n
maxa = 0
for i in range(n):
x, y = list(map(int, input().split()))
maxa = max(x, maxa)
b[i] = y
b.sort(reverse = True)
ans = 0
for i in range(n):
if b[i] < maxa:
break
h -= b[i]
ans += 1
if h <= 0:
... | p03472 |
N, H = [int(_) for _ in input().split()]
katana = [[int(_) for _ in input().split()] for _ in range(N)]
katana.sort(key=lambda x:x[1], reverse=True)
a_max_katana = max(katana)
a_max = a_max_katana[0]
a_max_b = a_max_katana[1]
katana.pop(katana.index(a_max_katana))
count = 0
for katana_use in katana:
... | N, H = [int(_) for _ in input().split()]
katana = [[int(_) for _ in input().split()] for _ in range(N)]
katana.sort(key=lambda x:x[1], reverse=True)
a_max_katana = max(katana)
a_max = a_max_katana[0]
a_max_b = a_max_katana[1]
katana.pop(katana.index(a_max_katana))
count = 0
for katana_use in katana:
... | p03472 |
from collections import deque
n,h=list(map(int,input().split()))
l=[list(map(int,input().split())) for _ in range(n)]
l.sort(reverse=True)
fa,fb=l[0]
M=max(fa,fb)
if n==1:
print((max(0,(h-M-1)//fa)+2-(h<=M)))
else:
cnt=0;tmp=[]
for _,j in l[1:]:
if j>fa:
tmp.append(j)
b=deque(sorted(tmp))
lim=le... | n,h,*l=list(map(int,open(0).read().split()))
a=max(l[::2])
c=0;f=1
for b in sorted(l[1::2])[::-1]:
if b>a:
h-=b
c+=1
if h<1:
f=0
break
print((c+(~-h//a+1)*f)) | p03472 |
import math
n,h = list(map(int,input().split()))
A = []
B = []
for i in range(n):
a,b = list(map(int,input().split()))
A.append(a)
B.append(b)
x = max(A)
B = sorted(B, reverse=True)
B_lst = []
for i in range(n):
if B[i] > x:
B_lst.append(B[i])
cnt = 0
damage = 0
ans... | from math import ceil
n,h = list(map(int,input().split()))
a,b = [],[]
for _ in range(n):
a_,b_ = list(map(int,input().split()))
a.append(a_)
b.append(b_)
mx_a = max(a)
b.sort(reverse=True)
cnt = 0
tmp = 0
for b_ in b:
if b_ >= mx_a:
tmp += b_
cnt += 1
if tmp >= h:... | p03472 |
import sys
import math
N, H = list(map(int, input().split()))
a = []
b = []
num_attack = 0
for _ in range(N):
a_i, b_i = list(map(int, input().split()))
a.append(a_i)
b.append(b_i)
max_a = max(a)
Strong_b = [b_i for b_i in b if b_i > max_a]
if sum(Strong_b) >= H:
while H > 0:
H -= max(Stro... | import sys
import math
N, H = list(map(int, input().split()))
a = []
b = []
num_attack = 0
for _ in range(N):
a_i, b_i = list(map(int, input().split()))
a.append(a_i)
b.append(b_i)
max_a = max(a)
Strong_b = [b_i for b_i in b if b_i > max_a]
if sum(Strong_b) >= H:
Strong_b = sorted(Strong_b, rever... | p03472 |
# coding=utf-8
from math import floor, ceil, sqrt, factorial, log, gcd, log10
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement, chain
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from heapq import heappop, heapp... | # coding=utf-8
from math import floor, ceil, sqrt, factorial, log, gcd, log10
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement, chain
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from heapq import heappop, heapp... | p03472 |
n,h = list(map(int,input().split()))
a_list = []
b_list = []
use_b_list = []
for i in range(n):
a,b = list(map(int,input().split()))
a_list.append(a)
b_list.append(b)
import math
for b in b_list:
if b > max(a_list):
use_b_list.append(b)
use_b_list.sort(reverse = True)
count = 0
if sum(use_... | n,h = list(map(int,input().split()))
a_list = []
b_list = []
use_b_list = []
for i in range(n):
a,b = list(map(int,input().split()))
a_list.append(a)
b_list.append(b)
use_a = max(a_list)
import math
for b in b_list:
if b > use_a:
use_b_list.append(b)
use_b_list.sort(reverse = True)
count =... | p03472 |
import math
N,H = list(map(int,input().split()))
data=[]
for i in range(N):
a,b = list(map(int,input().split()))
data.append([a,b,i])
s1 = sorted(data,key = lambda x:(-x[1],x[0]))
s2 = sorted(data,key = lambda x:(-x[0],x[1]))
cnt = 0
maxNum = s2[0][2]
for i in range(N):
if H > 0:
if ... | import math
N,H = list(map(int,input().split()))
data=[]
for i in range(N):
a,b = list(map(int,input().split()))
data.append([a,b])
s1 = sorted(data,key = lambda x:-x[1])
s2 = sorted(data,key = lambda x:-x[0])
cnt = 0
for i in range(N):
if H > 0:
if s1[i][1] > s2[0][0]:
... | p03472 |
n,h = list(map(int,input().split()))
x = (tuple(map(int, input().split())) for _ in [0] * n)
a2,b = [],[]
for j in x:
a2.append(j[0])
b.append(j[1])
a = max(a2)
b = [i for i in b if i>a]
b.sort()
b = b[::-1]
if h <= sum(b):
num,i = 0,0
while h > 0:
h -= b[i]
num += 1
i += 1
else:
h -= sum(b)... | n,h = (int(i) for i in input().split())
x = [[int(i) for i in input().split()] for i in range(n)]
a,b = 0,[]
for j in x:
if a < j[0]: a = j[0]
b.append(j[1])
b = [i for i in b if i>a]
b.sort()
b = b[::-1]
if h <= sum(b):
num,i = 0,0
while h > 0:
h -= b[i]
num += 1
i += 1
else:
h -= sum(b)
n... | p03472 |
def slove():
import sys
import heapq
input = sys.stdin.readline
n, h = list(map(int, input().rstrip('\n').split()))
m_k = 0
t = []
heapq.heapify(t)
for i in range(n):
a, b = list(map(int, input().rstrip('\n').split()))
m_k = max(m_k, a)
heapq.heappush(t... | def slove():
import sys
input = sys.stdin.readline
al = []
bl = []
n, h = list(map(int, input().rstrip('\n').split()))
for i in range(n):
a, b = list(map(int, input().rstrip('\n').split()))
al.append(a)
bl.append(b)
al.sort()
bl.sort()
cnt = 0
... | p03472 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, h = list(map(int, input().rstrip('\n').split()))
al = 0
bl = []
for i in range(n):
a, b = list(map(int, input().rstrip('\n').split()))
al = max(al, a)
bl.append(b)
bl.sort()
cn... | import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, h = list(map(int, input().rstrip('\n').split()))
md = 0
dl = []
for i in range(n):
a, b = list(map(int, input().rstrip('\n').split()))
md = max(md, a)
dl.append(b)
dl.sort(reverse=T... | p03472 |
import math
N,H = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(N)]
n = max(src)[0]
src.sort(key=lambda x:x[1],reverse=True)
ans = d = 0
for a,b in src:
if b <= n: break
d += b
ans += 1
if d >= H:
print(ans)
exit()
ans += math.ceil((H... | N,H = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(N)]
maxa = max(src)[0]
ans = 0
for a,b in sorted(src, key=lambda x:x[1], reverse=True):
if b <= maxa:
break
H -= b
ans += 1
if H <= 0:
print(ans)
exit()
ans += (H-1)//maxa +... | p03472 |
def main():
N, H = list(map(int, input().split()))
A = [0] * N
B = [0] * N
num_list = []
for i in range(N):
a, b = list(map(int, input().split()))
A[i] = a
B[i] = b
num_list.append(a)
num_list.append(b)
num = sorted(num_list, reverse=True)... | def main():
N, H = list(map(int, input().split()))
A = [0] * N
B = [0] * N
num_list = []
for i in range(N):
a, b = list(map(int, input().split()))
A[i] = a
B[i] = b
sort_B = sorted(B, reverse=True)
max_A = max(A)
ans = 0
for b in sort_B:
... | p03472 |
import sys
input = sys.stdin.readline
def main():
N, H = list(map(int, input().split()))
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
cnt = 0
max_A = max(A)
sort_B = sorted(B, reverse=True)
for b in sort_B:
if b >... | import sys
input = sys.stdin.readline
def main():
N, H = list(map(int, input().split()))
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
cnt = 0
max_A = max(A)
sort_B = sorted(B, reverse=True)
for b in sort_B:
if b >... | p03472 |
import bisect
from math import ceil
N,H=list(map(int, input().split()))
A=[]
B=[]
for i in range(N):
a,b=list(map(int, input().split()))
A.append(a)
B.append(b)
A=sorted(A)
B=sorted(B)
idx=bisect.bisect_right(B,A[-1])
throw=sum(B[idx:])
if throw<=H:
ans=N-idx
res=H-throw
an... | from math import ceil
N,H=list(map(int, input().split()))
A=[0]*N
B=[0]*N
for i in range(N):
a,b=list(map(int, input().split()))
A[i]=a
B[i]=b
A=sorted(A)
B=sorted(B, reverse=True)
amax=max(A)
ans=0
for i in range(N):
b=B[i]
if b>amax:
H-=b
ans+=1
if ... | p03472 |
from math import ceil
import sys
input=sys.stdin.readline
n, h = list(map(int, input().split()))
a = []
b = []
for i in range(n):
p, q = list(map(int, input().split()))
a.append(p)
b.append(q)
b.sort(reverse=1)
ans=0
m=max(a)
while(h>0 and len(b) != 0):
if b[0] < m:
break
h-=b[0]
b.pop(... | from math import ceil
import sys
input=sys.stdin.readline
n, h = list(map(int, input().split()))
a = []
b = []
for i in range(n):
p, q = list(map(int, input().split()))
a.append(p)
b.append(q)
b.sort()
ans=0
m=max(a)
while(h>0 and len(b) != 0):
if b[-1]< m:
break
h-=b.pop()
ans+=1
if... | p03472 |
n,h = list(map(int,input().split()))
x = []
for i in range(n):
x.append(list(map(int,input().split())))
t = 0
c = []#強い投げ刀たち
for i in range(n):
if x[i][1]>max(x[i][0] for i in range(n))-1:
c.append(x[i][1])
c.sort()
c.reverse()
if sum(c)>h-1:
for i in range(len(c)):
t += 1
h -= c[i]
if h<1... | n,h = list(map(int,input().split()))
x = []
for i in range(n):
x.append(list(map(int,input().split())))
t = 0
c = []#強い投げ刀たち
M = max(x[i][0] for i in range(n))
for i in range(n):
if x[i][1]>M-1:
c.append(x[i][1])
c.sort()
c.reverse()
if sum(c)>h-1:
for i in range(len(c)):
t += 1
h -= c[i]
... | p03472 |
# -*- coding: utf-8 -*-
# 入力から変数を初期化
N, H = list(map(int, input().split()))
a = []
b = []
for i in range(N):
ai, bi = list(map(int, input().split()))
a.append(ai)
b.append(bi)
ans = H
# 振る刀の最大値
amax = max(a)
# 投げる刀を降順でソートしておく
b.sort(reverse=True)
# 攻撃力の高い刀から順にk本投げ、残りの体力をamaxを使って削る
for... | # -*- coding: utf-8 -*-
# 入力から変数を初期化
N, H = list(map(int, input().split()))
a = []
b = []
for i in range(N):
ai, bi = list(map(int, input().split()))
a.append(ai)
b.append(bi)
ans = H
# 振る刀の最大値
amax = max(a)
# 投げる刀を降順でソートしておく
b.sort(reverse=True)
# 攻撃力の高い刀から順にk本投げ、残りの体力をamaxを使って削る
dam... | p03472 |
import sys
N, H = [int(x) for x in sys.stdin.readline().strip().split()]
A = []
B = []
for i in range(N):
a, b = [int(x) for x in sys.stdin.readline().strip().split()]
A.append(a)
B.append(b)
r = 1000000000000
for i in range(N):
p = A[i]
qs = [B[i] for i in range(N) if B[i] > p]
... | import sys
N, H = [int(x) for x in sys.stdin.readline().strip().split()]
AB = [tuple(int(x) for x in sys.stdin.readline().strip().split()) for i in range(N)]
AB.sort(key=lambda x:(-x[0],x[1]))
p = AB[0][0]
qs = [AB[j][1] for j in range(N) if AB[j][1] > p]
qs.sort(key=lambda x:-x)
r = 0
for i in range(len(qs... | p03472 |
import math
def find_argmax(num_list):
argmax = sorted(enumerate(num_list), key=lambda x:x[1])[-1][0]
return argmax
def find_all_more_than(threshold, num_list):
indices = [
idx
for idx, num in enumerate(num_list)
if num > threshold
]
return indices
def... | import math
def find_argmax(num_list):
argmax = sorted(enumerate(num_list), key=lambda x:x[1])[-1][0]
return argmax
def find_all_more_than(threshold, num_list):
indices = [
idx
for idx, num in enumerate(num_list)
if num > threshold
]
return indices
def... | p03472 |
n, h, *k = list(map(int, open(0).read().split()))
a = 0; b = []
for i, j in zip(*[iter(k)]*2):
a = max(a, i)
b.append(j)
b = sorted(b, reverse = True)
ans = 0
while ans < n and b[ans] > a and h > 0:
h -= b[ans]
ans += 1
if h > 0: ans += (h + a - 1) // a
print(ans) | n, h, *k = list(map(int, open(0).read().split()))
a = max(k[::2]); b = sorted(k[1::2], reverse = True)
ans = 0
while ans < n and b[ans] > a and h > 0:
h -= b[ans]
ans += 1
if h > 0: ans += (h + a - 1) // a
print(ans) | p03472 |
#!/usr/bin/env python3
import math
N, H = list(map(int, input().split()))
a = [0] * N
b = [0] * N
for i in range(N):
a[i], b[i] = list(map(int, input().split()))
b.sort(reverse=True)
m = max(a)
s = [0]
for i in range(N):
b[i] = max(b[i], m)
s.append(s[-1] + b[i])
if s[-1] >= H:
p... | #!/usr/bin/env python3
import math
N, H = list(map(int, input().split()))
a = [0] * N
b = [0] * N
for i in range(N):
a[i], b[i] = list(map(int, input().split()))
b.sort(reverse=True)
m = max(a)
s = 0
for i in range(N):
b[i] = max(b[i], m)
s += b[i]
if s >= H:
print((i + 1))
... | p03472 |
import sys
import math
n, h = list(map(int, input().split()))
a = 0
b = []
for i in range(n):
x, y = list(map(int, input().split()))
a = max(a, x)
b.append(y)
b.sort(reverse=True)
b = [x for x in b if x > a]
for i, x in enumerate(b):
h -= x
if h <= 0:
print((i + 1))
... | import sys
n, h = list(map(int, input().split()))
max_a = 0
b = []
for i in range(n):
x, y = list(map(int, input().split()))
max_a = max(max_a, x)
b.append(y)
# 投げる価値がある刀を抜粋する
b = [x for x in b if x > max_a]
# 強い順に投げていく
b.sort(reverse=True)
i = 0
if len(b) > 0:
for i, x in enumer... | p03472 |
N,H = list(map(int,input().split()))
ans = 0
A = []
B = []
for i in range(N) :
a,b = list(map(int,input().split()))
A.append(a)
B.append(b)
B = sorted(B,reverse = True)
flag = 0
for i in range(N) :
if H <= 0 :
break
if max(A) < B[i] :
H -= B[i]
ans += 1
el... | N,HP = list(map(int,input().split()))
L = list(list(map(int,input().split())) for i in range(N))
L = sorted(L, key=lambda x: x[0], reverse=True)
max_a = L[0][0]
L = sorted(L, key=lambda x: x[1], reverse=True)
ans = 0
for i in range(N) :
if L[i][1] < max_a :
break
HP -= L[i][1]
ans +=... | p03472 |
def solve():
N, HP = list(map(int, input().split()))
score = 0
f = []
n = []
for i in range(N):
a, b = list(map(int, input().split()))
f.append(a)
n.append(b)
#最後まで使う刀保存
lastf = max(f)
lastid = f.index(lastf)
lastn = n[lastid]
for i i... | def solve():
N, HP = list(map(int, input().split()))
score = 0
f = []
n = []
for i in range(N):
a, b = list(map(int, input().split()))
f.append(a)
n.append(b)
#最後まで使う刀保存
lastf = max(f)
lastid = f.index(lastf)
lastn = n[lastid]
n.sort(reve... | p03472 |
from heapq import heappush, heappop
def solve():
N, H = list(map(int, input().split()))
cut_dmgs = []
thr_dmgs = []
for _ in range(N):
a, b = list(map(int, input().split()))
heappush(cut_dmgs, -a)
heappush(thr_dmgs, -b)
ans = 0
max_cut_dmg = -min(cut_dmgs)... | N, H, *blades = list(map(int, open(0).read().split()))
cut = max(blades[::2])
throws = sorted(b for b in blades[1::2] if b >= cut)
ans = 0
while throws:
H -= throws.pop()
ans += 1
if H <= 0:
print(ans)
exit()
ans += (H + cut - 1) // cut
print(ans) | p03472 |
n,h=list(map(int,input().split()))
A=list(tuple(map(int,input().split())) for i in range(n))
A,B=list(zip(*A))
a=max(A)
count=0
for i in sorted(B)[::-1]:
if h<=0:break
elif i>=a:
count +=1
h -=i
if h>0:
count +=(h-1)//a+1
print(count) | n,h=list(map(int,input().split()))
A=list(tuple(map(int,input().split())) for i in range(n))
A,B=list(zip(*A))
a=max(A)
count=0
for i in sorted(B)[::-1]:
if h<=0:break
elif i>=a:
count +=1
h -=i
if h>0:
if h%a==0:count +=h//a
else:count +=h//a+1
print(count) | p03472 |
n, h = list(map(int, input().split()))
arr = []
for _ in range(n) :
a,b = list(map(int, input().split()))
arr.append((a,-1))
arr.append((b,1))
arr.sort()
arr.reverse()
cnt = 0
ans = 10**9 + 100
for p in arr :
if p[1] == -1 :
# a
ans = min(ans, cnt + (h+p[0]-1)//p[0])
... | n, h = list(map(int, input().split()))
arr = []
for _ in range(n) :
a,b = list(map(int, input().split()))
arr.append((a,-1))
arr.append((b,1))
arr.sort()
arr.reverse()
cnt = 0
ans = 10**9 + 100
for p in arr :
if p[1] == -1 :
# a
ans = min(ans, cnt + (h+p[0]-1)//p[0])
... | p03472 |
from math import ceil
N, H = list(map(int, input().split()))
A, B = [], []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a), B.append(b)
B = sorted(list([x for x in B if x > max(A)]))
count = 0
while H > 0:
if B:
H -= B.pop()
else:
count += ceil(H /... | from math import ceil
N, H = list(map(int, input().split()))
A, B = [], []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a), B.append(b)
max_a = max(A)
B = sorted(list([x for x in B if x > max_a]))
count = 0
while H > 0:
if B:
H -= B.pop()
else:
co... | p03472 |
def d_katana_thrower(N, H, Swords):
import math
# 振ったとき最もダメージが大きい刀以上に投げたときのダメージが大きな刀
# について、ダメージが大きなものから投げていく。そのダメージの総和が
# 敵の体力より大きければ投げて倒せばいいし、足りなければ刀を降って倒せばいい。
# ただし、振る刀の投げダメージが振るより高ければ、投げる前に振らなければならないが、
# 計算時には「投げてから振る」とみなしても問題ない。
swing_damage_max = max([s[0] for s in Swords])
... | def d_katana_thrower():
# 最大振り火力をもつ刀以上の投げ火力をもつ刀は、大火力のものから順に投げる。
# 投げダメージの総和が敵の体力より大きければ投げて倒せばいいし、
# 足りなければ最大振り火力をもつ刀を降り続けて倒せばいい。
# ただし、最大振り火力をもつ刀については、投げ火力が振り火力より高くても、
# 投げる前に振らなければならないが、「投げてから振る」とみなして問題ない。
N, H = [int(i) for i in input().split()]
Swords = [[int(i) for i in input().sp... | p03472 |
mina=10**10
def waru(a,b):
if a%b==0:
return a//b
else:
return (a//b)+1
N,H=list(map(int,input().split()))
A=list()
B=list()
for i in range(N):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
sb=sum(B)
for i in range(N):
S=[k for k in B if k>A[i]]
n=sum(S)
if H-n<=0:
... | import sys
mina=10**10
def waru(a,b):
if a%b==0:
return a//b
else:
return (a//b)+1
N,H=list(map(int,input().split()))
A=list()
B=list()
for i in range(N):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
ma=max(A)
ind=A.index(ma)
B=[i for i in B if i>ma]
B=sorted(B,reverse=T... | p03472 |
n, h = [int(t) for t in input().split()]
aa = []
bb = []
for _ in range(n):
a, b = [int(t) for t in input().split()]
aa.append(a)
if b > a:
bb.append(b)
aa.sort()
bb.sort()
cnt = 0
while h > 0:
if not bb:
cnt += (h - 1) // aa[-1] + 1
break
elif bb[-1] > aa[-1... | n, h = [int(t) for t in input().split()]
aa = []
bb = []
for _ in range(n):
a, b = [int(t) for t in input().split()]
aa.append(a)
if b > a:
bb.append(b)
aa.sort()
bb.sort()
cnt = 0
while h > 0:
if not bb or aa[-1] >= bb[-1]:
cnt += (h - 1) // aa[-1] + 1
break
... | p03472 |
import math
N , H = list(map(int , input().split()))
slash = []
throw = []
for _ in range(N):
a , b = list(map(int , input().split()))
slash.append(a)
throw.append(b)
count = 0
#print(slash)
slash_max = max(slash)
#print(throw)
throw.sort(reverse = True)
#print(throw)
while H > 0:
#print(... | import math
N, H = list(map(int, input().split()))
a_l = []
b_l = []
for _ in range(N):
a, b = list(map(int, input().split()))
a_l.append(a)
b_l.append(b)
a_l.sort(reverse=True)
b_l.sort(reverse=True)
ans = 0
for i in range(N):
if a_l[0] >= b_l[i]:
break
else:
ans ... | p03472 |
from collections import Counter
from functools import reduce
from itertools import combinations
from operator import xor
n = int(eval(input()))
nodes = [0] * n
for _ in range(n - 1):
x, y, a = list(map(int, input().split()))
nodes[x] ^= a
nodes[y] ^= a
c = Counter(nodes)
ans = 0
remains = se... | from collections import Counter
from functools import reduce
from itertools import combinations
from operator import xor
n = int(eval(input()))
nodes = [0] * n
for _ in range(n - 1):
x, y, a = list(map(int, input().split()))
nodes[x] ^= a
nodes[y] ^= a
c = Counter(nodes)
del c[0]
ans = 0
re... | p03442 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
def f(v,i,ans):
if i == 0:return
if str(v)[-1] != "0":
x = int(str(v)+str(int(str(v)[-1])-1))
ans.add(x)
f(x,i-1,ans)
y = int(str(v)+str(v)[-1])
ans.add(y)
f(y,i-1,ans)
if str(v)[-1] != "9... | import sys
input = sys.stdin.readline
from collections import deque
def main():
K = int(eval(input()))
que = deque(["1", "2", "3", "4", "5", "6", "7", "8", "9"])
if K <= 9:
print((que[K-1]))
else:
K -= 9
while K >= 0:
v = que.popleft()
if v[-1]... | p02720 |
# 再帰的なDFS
def rec(d, val, nums):
nums.append(val)
if d == 10:
return
for delta in (-1, 0, 1):
add = val % 10 + delta
if add >= 0 and add <= 9:
rec(d+1, val * 10 + add, nums)
def main():
K = int(eval(input()))
nums = []
for val in range(1, 1... | from collections import deque
K = int(eval(input()))
que = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for i in range(K):
num = que.popleft()
if i == K-1:
print(num)
break
if num%10 == 0:
que.append(num*10 + num%10)
que.append(num*10 + num%10 + 1)
elif num%10 == 9:
... | p02720 |
from collections import deque
from heapq import heappush, heappop
def main():
K = int(eval(input()))
q = []
for i in range(1, 10):
heappush(q, i)
while True:
v = heappop(q)
K -= 1
if K == 0:
print(v)
exit()
u = v % ... | from collections import deque
from collections import deque
def main():
K = int(eval(input()))
q = deque()
for i in range(1, 10):
q.append(i)
while True:
v = q.popleft()
K -= 1
if K == 0:
print(v)
exit()
u = v % 10
... | p02720 |
K = int(eval(input()))
ans = []
R = [[] for _ in range(11)]
for i in range(1,10):
R[0].append(i)
for i in range(1,11):
R[i] = [10**i]
if i > 1:
for j in range(i-1):
for r in R[i-2-j]:
d = r//(10**(i-2-j))
if d <= 1:
R[i].append(10**i+r)
for r in R[i-1]:
d = ... | from heapq import heappush, heappop
K = int(eval(input()))
hq = []
for i in range(1,10):
heappush(hq,i)
cnt = 0
while(cnt < K):
x = heappop(hq)
cnt += 1
for i in [-1,0,1]:
d = (x%10)+i
if 0 <= d <= 9:
heappush(hq,x*10+d)
print(x)
| p02720 |
from collections import deque
k=int(eval(input()))
d=deque()
for i in range(1,10): d.append(i)
for i in range(k):
x=d.popleft()
if i==k-1:
print(x)
break
if x%10!=0:
d.append(10*x+x%10-1)
d.append(10*x+x%10)
if x%10!=9:
d.append(10*x+x%10+1) | from collections import deque
d=deque(list(range(1,10)))
for i in range(int(eval(input()))):
x=d.popleft()
r=x%10;c=x*10+r
if r!=0:d.append(c-1)
d.append(c)
if r!=9:d.append(c+1)
print(x) | p02720 |
k=int(eval(input()))
l=[]
for i1 in range(10):
l.append(i1)
for i2 in range(max(i1-1,0),min(i1+2,10)):
l.append(i1*(10**1)+i2)
for i3 in range(max(i2-1,0),min(i2+2,10)):
l.append(i1*(10**2)+i2*(10**1)+i3)
for i4 in range(max(i3-1,0),min(i3+2,10)):
l.append(i1*(10**3)+i2*(10**2)+... | import copy
k=int(eval(input()))
ans=[[str(i+1) for i in range(9)]]
l2=[]
for i in range(9):
l=ans[-1]
l2=[]
for j in range(len(l)):
if int(l[j][-1])!=0:
l2.append(l[j]+str(int(l[j][-1])-1))
l2.append(l[j]+str(int(l[j][-1])))
if int(l[j][-1])!=9:
l2.append(l[j]+str(int(l[j][-1]... | p02720 |
from collections import deque
def main():
k = int(eval(input()))
queue = deque([i for i in range(1, 10)])
pop_time = 0
now = 1
while pop_time < k:
now = queue.popleft()
if now % 10 != 0:
queue.append(10 * now + now % 10 - 1)
queue.append(10 * now + n... | from collections import deque
def main():
k = int(eval(input()))
q = deque([i for i in range(1, 10)])
answer = 0
for i in range(k):
now = q.popleft()
answer = now
if now % 10 != 0:
q.append(10 * now + now % 10 - 1)
q.append(10 * now + now % 10)
... | p02720 |
K = int(eval(input()))
V = [1, 2, 3, 4, 5, 6, 7, 8, 9]
for i in range (0, 100000):
if V[i]%10 == 0:
V.append(10*V[i]+0)
V.append(10*V[i]+1)
elif V[i]%10 == 9:
V.append(10*V[i]+8)
V.append(10*V[i]+9)
else:
V.append(10*V[i]+V[i]%10-1)
V.append(10*V[i]+V[i]%10)
V.append(10*V[i]+V[i]%10+1)
... | import collections
K = int(eval(input()))
L = [1,2,3,4,5,6,7,8,9]
Q = collections.deque(L)
count = 0
while count < K-1:
V = Q.popleft()
count+=1
if V%10 == 0:
Q.append(10*V)
Q.append(10*V+1)
elif V%10 == 9:
Q.append(10*V+8)
Q.append(10*V+9)
else:
... | p02720 |
k = int(eval(input()))
def dfs(now, depth):
STACK.append(str(now))
if depth == limit:
LUNLUN.append(int("".join(STACK)))
else:
for next in range(now - 1, now + 2):
if next == -1 or next == 10:
continue
dfs(next, depth + 1)
STACK.pop()
... | k = int(eval(input()))
L = list(range(10))
i = 1
while len(L) <= k:
Li = L[i]
a = Li % 10
for b in range(a - 1, a + 2):
if b < 0 or b > 9:
continue
L.append(Li * 10 + b)
i += 1
print((L[k]))
| p02720 |
k = int(eval(input()))
a=['1','2','3','4','5','6','7','8','9']
while 1:
if k<=len(a):
print((a[k-1]))
exit()
b=[]
for i in a:
if i[-1]!='0':
b.append(i+chr(ord(i[-1])-1))
b.append(i+i[-1])
if i[-1]!='9':
b.append(i+chr(ord(i[-1])+... | k = int(eval(input()))
a=['1','2','3','4','5','6','7','8','9']
while k>len(a):
b=[]
for i in a:
if i[-1]!='0':
b.append(i+chr(ord(i[-1])-1))
b.append(i+i[-1])
if i[-1]!='9':
b.append(i+chr(ord(i[-1])+1))
k-=len(a)
a=b.copy()
print((a[k-1])) | p02720 |
K = int(eval(input()))
def dfs(d, val, x):
x.append(val)
if d == 10:
return
for i in range(-1, 2):
add = (val % 10) + i
if 0 <= add <= 9:
dfs(d + 1, val * 10 + add, x)
x = []
for i in range(1, 10):
dfs(0, i, x)
print((sorted(x)[K - 1]))
| from collections import deque
K = int(eval(input()))
q = deque(list(range(1, 10)))
ctr = 0
while ctr < K:
val = q.popleft()
ctr += 1
for i in range(-1, 2):
add = (val % 10) + i
if 0 <= add <= 9:
q.append(val * 10 + add)
print(val)
| p02720 |
from collections import deque
K = int(eval(input()))
q = deque(list(range(1, 10)))
cnt = 0
ans = 0
while True:
u = q.popleft()
cnt += 1
if cnt == K:
ans = u
break
ll = u % 10
for i in range(max(0, ll - 1), min(9, ll + 1) + 1):
q.append(u * 10 + i)
print(... |
from collections import deque
K = int(eval(input()))
q = deque(list(range(1, 10)))
for _ in range(K - 1):
u = q.popleft()
n = u % 10
for x in range(max(0, n - 1), min(9, n + 1) + 1):
q.append(u * 10 + x)
print((q.popleft()))
| p02720 |
from queue import Queue
def solve():
K = int(eval(input()))
q = Queue()
for i in range(9):
q.put(i+1)
num = 0
for i in range(K):
num = q.get()
if num % 10 != 0:
q.put(num*10+num % 10-1)
q.put(num*10+num % 10)
if num % 10 != 9:
... | from collections import deque
def solve():
K = int(eval(input()))
dq = deque()
# 一桁のケース
for i in range(9):
dq.append(i+1)
for i in range(K):
num = dq.popleft()
if num % 10 != 0:
dq.append(num*10+num % 10-1)
dq.append(num*10+num % 10)
... | p02720 |
maxn = 100005
def solve(n):
if n<=9:
return n
q = [0 for i in range(maxn)]
front = 1
rear = 0
for i in range(1,10):
rear += 1
q[rear] = i
cnt = 9
while 1:
u = q[front]
front += 1
if u%10 != 0:
t = u*10 + u%10 -1
rear += 1
q[rear] = t
cnt += 1
if cnt==n:
return... | def solve(n):
if n<=9:
return n
q = [0]
for i in range(1,10):
q.append(i)
now = 1
cnt = 9
while 1:
u = q[now]
now += 1
if u%10!=0:
t = u*10 + u%10 - 1
cnt += 1
if cnt==n:
return t
q.append(t)
t = u*10 + u%10
cnt += 1
if cnt==n:
return t
q.append(t)
if u... | p02720 |
from itertools import product
K = int(eval(input()))
ans = []
for l in range(10):
for s in range(1, 10):
for pattern in product([0, 1, 2], repeat=l): # そのまま, １つ上, １つ下
X = [s]
for p in pattern:
if X[-1] == 0 and p == 2:
break
... | from itertools import product
K = int(eval(input()))
ans = []
for l in range(10):
for s in range(1, 10):
for pattern in product([-1, 0, 1], repeat=l):
X = [s]
for p in pattern:
if not (0 <= X[-1] + p <= 9):
break
X.appen... | p02720 |
k = int(eval(input()))
numset = {i for i in range(1,10)}
flag = False
count = len(numset)
if count >= k:
flag = True
arr = [numset]
index = 0
while not flag:
beforeset = arr[index]
tmpset = set()
for i in beforeset:
tail = str(i)[-1]
if tail == "0":
tmpset.a... | k = int(eval(input()))
from collections import deque
queue = deque(list(range(1,10)))
count = 0
while count < k:
tmp = queue.popleft()
tail = tmp%10
if tail != 0:
queue.append(tmp*10+tail-1)
queue.append(tmp*10+tail)
if tail != 9:
queue.append(tmp*10+tail+1)
count... | p02720 |
from collections import deque
K = int(eval(input()))
q = deque([0])
cnt = 0
ans = []
while q:
a = q.popleft()
r = a % 10
a *= 10
for i in range(10):
if abs(r - i) <= 1 or a == 0:
if cnt < K and a + i != 0:
q.append(a + i)
ans.append(a + i)
cnt += 1
print((ans... | from collections import deque
K = int(eval(input()))
q = deque([0])
cnt = 0
while q:
n = q.popleft()
r = n % 10; n *= 10;
for i in range(10):
if abs(r - i) <= 1 or n == 0:
if n + i != 0:
q.append(n + i)
cnt += 1
if cnt == K:
print((n+i))
exit() | p02720 |
def lunlun(n):
nums = set([1, 2, 3, 4, 5, 6, 7, 8, 9])
while len(nums) < n:
old_nums = list(nums)
for num in old_nums:
num = str(num)
if num[-1] == '0':
adds = num + '0'
if int(adds) not in nums:
nums.add(int(adds))
adds = num + '1'
if int(adds) not in nums:
nums.add(in... | def lunlun(n):
nums = set([1, 2, 3, 4, 5, 6, 7, 8, 9])
while len(nums) < n:
old_nums = list(nums)
for num in old_nums:
num = str(num)
if num[-1] == '0':
adds = num + '0'
if int(adds) not in nums:
nums.add(int(adds))
adds = num + '1'
if int(adds) not in nums:
nums.add(in... | p02720 |
import sys
sys.setrecursionlimit(10**9)
k=int(eval(input()))
def dfs(keta,num):
lunlun.append(int(num))
if keta==10:
return
min_v=max(0,int(num[-1])-1)
max_v=min(9,int(num[-1])+1)
for i in range(min_v,max_v+1):
dfs(keta+1,num+str(i))
lunlun=[]
for i in range(1,10):
dfs(0,str(i... | k=int(eval(input()))
def dfs(keta,num):
global ans
ans.append(int(''.join(num)))
if keta==10:
return
min_n=max(0,int(num[-1])-1)
max_n=min(9,int(num[-1])+1)
for i in range(min_n,max_n+1):
dfs(keta+1,num+[str(i)])
ans=[]
for i in range(1,10):
dfs(1,[str(i)])
ans.sort()
print... | p02720 |
#!/usr/bin/env python3
from heapq import *
a = [*list(range(1, 10))]
heapify(a)
i = 0
k = int(eval(input()))
c = 0
while True:
t = str(heappop(a))
i += 1
if i == k:
break
if t[-1] != "0":
heappush(a, int(t + str(int(t[-1]) - 1)))
heappush(a, int(t + t[-1]))
if t[... | # !/usr/bin/env python3
# from heapq import *
#
# a = [*range(1, 10)]
# heapify(a)
# i = 0
# k = int(input())
# c = 0
# while True:
# t = str(heappop(a))
# i += 1
# if i == k:
# break
# if t[-1] != "0":
# heappush(a, int(t + str(int(t[-1]) - 1)))
# heappush(a, int(t + t[-1]))... | p02720 |
import heapq
K=int(eval(input()))
if K<10:
print(K)
exit()
nums=[1, 2, 3, 4, 5, 6, 7, 8, 9]
heapq.heapify(nums)
for i in range(K):
value=heapq.heappop(nums)
tmp=str(value)
if tmp[-1]=='0':
cand=[int(tmp+'0'), int(tmp+'1')]
elif tmp[-1]=='9':
cand=[int(tmp+'8'), int(tmp+'9')]
else... | from collections import deque
K=int(eval(input()))
q=deque()
for i in range(1, 10):
q.append(i)
for i in range(K):
v=q.popleft()
if v%10!=0:
q.append(10*v+v%10-1)
q.append(10*v+v%10)
if v%10!=9:
q.append(10*v+v%10+1)
print(v) | p02720 |
import queue
def solved(n):
if n <= 9:
return n
nums = queue.Queue()
for i in range(1, 10):
nums.put(i)
cnt = 9
for i in range(cnt, n):
i_num = nums.get()
ini_num = i_num % 10
for j in range(max(0, ini_num - 1), min(10, ini_num + 2)):
n... | import queue
def solve(n):
if n < 10:
return n
cnt = 0
next = queue.Queue()
for i in range(1, 10):
next.put(i)
cnt += 1
while True:
i = next.get()
for j in range(i % 10 - 1, i % 10 + 2):
if j < 0 or 9 < j:
continue
... | p02720 |
def main():
from collections import deque
k = int(eval(input()))
ans = 0
que = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
x = 0
for _ in range(k):
x = que.popleft()
p = x % 10
e = 10 * x
if p != 0:
a = e + p - 1
que.append(a)
... | def LunLun(k, count, base):
nx = []
n = len(base)
if count + n >= k:
print((base[k - count - 1]))
return
for x in base:
count += 1
p = x % 10
x *= 10
a = x + p - 1
b = a + 1
c = b + 1
n = 3
if p == 0:
... | p02720 |
def LunLun(k, count, base):
nx = []
n = len(base)
if count + n >= k:
ans = base[k - count - 1]
return ans
for x in base:
count += 1
p = x % 10
x *= 10
a = x + p - 1
b = a + 1
c = b + 1
n = 3
if p == 0:
... | def LunLun(k, count, base):
nx = []
n = len(base)
if count + n >= k:
ans = base[k - count - 1]
print(ans)
exit()
for x in base:
count += 1
p = x % 10
x *= 10
a = x + p - 1
b = a + 1
c = b + 1
n = 3
i... | p02720 |
# coding: utf-8
# Your code here!
from collections import deque
k=int(eval(input()))
ans=[]
d=deque([1,2,3,4,5,6,7,8,9])
c=0
while c<11:
q=d.popleft()
ans.append(q)
c=len(str(q))
b=q%10
if b!=0:
d.append(q*10+b-1)
d.append(q*10+b)
if b!=9:
d.append(q*10+b+1)
... | # coding: utf-8
# Your code here!
from collections import deque
k=int(eval(input()))
ans=[]
d=deque([1,2,3,4,5,6,7,8,9])
c=0
while c<100100:
q=d.popleft()
ans.append(q)
c+=1
b=q%10
if b!=0:
d.append(q*10+b-1)
d.append(q*10+b)
if b!=9:
d.append(q*10+b+1)
... | p02720 |
n=int(eval(input()))
if n<10: print(n); exit()
l=[[[] for _ in range(10)] for _ in range(10)]
l[0]=[[i] for i in range(10)]
c=9
for i in range(9):
for j in range(10):
for k in (-1,0,1):
if 0<=j+k<=9:
for h in l[i][j+k]:
if j: c+=1
t=j*10**(i+1)+h
l[i+1][j]+=... | n=int(eval(input()))
if n<10: print(n); exit()
r=range
l=[[[] for _ in r(10)] for _ in r(10)]
l[0]=[[i] for i in r(10)]
c=9
for i in r(9):
for j in r(10):
for k in r(-1,2):
if 0<=j+k<=9:
for h in l[i][j+k]:
if j: c+=1
t=j*10**(i+1)+h
l[i+1][j]+=[t]
... | p02720 |
from collections import *
k=int(eval(input()));q=deque(list(range(1,10)));c=0
while c<k:
t=q.popleft()
for j in range(max(t%10-1,0),min(t%10+2,10)): q+=[t*10+j]
c+=1
print(t) | k=int(eval(input()));l=list(range(1,10))
for i in l:
if len(l)>k: break
for j in range(max(i%10-1,0),min(i%10+2,10)): l.append(i*10+j)
print((l[k-1])) | p02720 |
k = int(eval(input()))
lunlun = list(range(1, 10))
for i in range(k - 1):
a = lunlun[i]
b = a * 10 + a % 10
if a % 10 != 0:
lunlun.append(b - 1)
lunlun.append(b)
if a % 10 != 9:
lunlun.append(b + 1)
print((lunlun[k - 1])) | k = int(eval(input()))
li = [i + 1 for i in range(9)]
c = 0
while len(li) < k:
if li[c] % 10 != 0:
li.append(li[c] * 10 + li[c] % 10 - 1)
li.append(li[c] * 10 + li[c] % 10)
if li[c] % 10 != 9:
li.append(li[c] * 10 + li[c] % 10 + 1)
c += 1
print((li[k - 1])) | p02720 |
k = int(eval(input()))
cnt = 1
loop = 1
r_li = []
# 一桁小さいるんるんリストから次のるんるんリストを作成
def make_runrun(i, runrun_list):
new_list = []
for runrun in runrun_list:
new_list.append('{}{}'.format(i, runrun))
return new_list
tmp = [[str(i)] for i in range(10)]
r_li = [str(i) for i in range(1, 10)]
... | from collections import deque
k = int(eval(input()))
lunlun = deque([])
ans = 0
# 一桁のルンルン数
for i in range(1, 10):
lunlun.append(str(i))
if k < 10:
ans = lunlun[k - 1]
# 二桁以上のルンルン数
cnt = 9
while cnt < k + 1:
# 1番小さなルンルン数を抜き出す
l = lunlun.popleft()
l_last = int(l[-1])
if l_last !... | p02720 |
def dfs(inParam, digits, lunlunCount, lunlun):
if len(inParam) != digits:
if int(inParam[len(inParam)-1]) == 0:
nextNumList = [0, 1]
elif int(inParam[len(inParam)-1]) == 9:
nextNumList = [8, 9]
else:
nextNum = int(inParam[len(inParam)-1])
... | K = int(eval(input()))
if K <= 9:
print(K)
else:
mylun = 9
lunList = []
for indx in range(1, 10):
lunList.append(str(indx))
while mylun < K:
newLunList = []
for lunItem in lunList:
if lunItem[len(lunItem)-1] != "0":
mylun += 1
... | p02720 |
k=int(eval(input()))
cand=[[1,2,3,4,5,6,7,8,9]]
for _ in range(9):
tmp=[]
for val in cand[-1]:
s=str(val)
if s[-1]=='0':
tmp.append(val*10)
tmp.append(val*10+1)
elif s[-1]=='9':
tmp.append(val*10+8)
tmp.append(val*10+9)
... | k=int(eval(input()))
cand=[[1,2,3,4,5,6,7,8,9]]
for _ in range(9):
tmp=[]
for val in cand[-1]:
if val%10!=0:
tmp.append(val*10+(val%10-1))
tmp.append(val*10+(val%10))
if val%10!=9:
tmp.append(val*10+(val%10+1))
cand.append(tmp)
ans=[]
for i in range(len(cand)):
for val in ca... | p02720 |
import queue
k = int(eval(input()))
q = queue.Queue()
for i in range(1,10):
q.put(i)
for i in range(k):
x = q.get()
if not x%10 == 0:
q.put(10*x+(x%10)-1)
q.put(10*x+(x%10))
if not x%10 == 9:
q.put(10*x+(x%10)+1)
print(x)
| import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
def main():
k = int(ipt())
... | p02720 |
import collections
def go_next(digits):
if all(x==9 for x in digits):
return [0]*len(digits) + [1]
digits[0] += 1
maxInc = -1
# print(digits)
for i in range(1, len(digits)):
if digits[i-1] >= 10 or abs(digits[i]-digits[i-1]) >= 2:
digits[i] += 1
... | def main():
from collections import deque
K = int(eval(input()))
q = deque(list(range(1, 10)))
for _ in range(K):
x = q.popleft()
lastdigit = x%10
base = x*10 + lastdigit
if lastdigit != 0:
q.append(base-1)
q.append(base)
if lastdi... | p02720 |
import sys
from collections import deque
input=sys.stdin.readline
sys.setrecursionlimit(10**6)
lunlun=deque()
def dfs(now):
if len(now)>10:return
lunlun.append(int(now))
l=now[-1]
if l!="0":
dfs(now+str(int(l)-1))
if l!="9":
dfs(now+str(int(l)+1))
dfs(now+l... | import sys
from collections import deque
input=sys.stdin.readline
sys.setrecursionlimit(10**6)
def main():
k=int(input().rstrip())
lunlun=deque([str(i) for i in range(1,10)])
for _ in range(k-1):
now=lunlun.popleft()
last=now[-1]
if last!="0":
lunlun.append(n... | p02720 |
import sys
input = sys.stdin.readline
import itertools
lunlun = [[] for i in range(11)]
def main():
n = int(eval(input()))
for i in range(100):
flag = True
l = len(str(i))
if l == 1:
lunlun[l - 1].append(i)
else:
for a in range(1, len(str(i... | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
lunlun = [[] for i in range(11)]
lunlun[0] = [1, 2, 3, 4, 5, 6, 7, 8, 9]
cnt = 9
if n < 10:
print(n)
exit()
for j in range(0, 10):
for a in lunlun[j]:
for b in range(10):
... | p02720 |
import queue
k = int(eval(input()))
q = queue.Queue()
num = 0
for i in range(1,10):
q.put(i)
while num<k:
i = q.get()
l = i%10
if l!=0:
q.put(i*10+l-1)
q.put(i*10+l)
if l!=9:
q.put(i*10+l+1)
num += 1
print(i)
| k = int(eval(input()))
lst = [1,2,3,4,5,6,7,8,9]
count = 0
for i in range(k):
num = lst[count]
if num%10!=0:
lst.append(num*10+num%10-1)
lst.append(num*10+num%10)
if num%10!=9:
lst.append(num*10+num%10+1)
count += 1
print((lst[k-1]))
| p02720 |
from collections import deque
K = int(eval(input()))
dque = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
ans = 0
while True:
v = dque.popleft()
ans += 1
if ans == K:
print(v)
exit(0)
strv = str(v)
if strv[-1] == '0':
dque.append(int(strv+'0'))
dque.append(int... | from collections import deque
K = int(eval(input()))
dque = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
ans = 0
while True:
v = dque.popleft()
ans += 1
if ans == K:
print(v)
exit(0)
for i in range(-1, 2):
# 10で割った余りを取得して、iを足す
tmp = v % 10+i
if not(0 <= t... | p02720 |
import copy
k = int(eval(input()))
lun = [1,2,3,4,5,6,7,8,9]
tlun = []
tlun = copy.deepcopy(lun)
length = 2
while len(lun) < k:
tmp = []
for x in tlun:
y = str(x)
xt = int( y[-1] )
a = xt + 1
b = xt - 1
if a != 10:
lun.append(int(y+str(a)))... |
import copy
k = int(eval(input()))
lun = [1,2,3,4,5,6,7,8,9]
tlun = []
tlun = copy.deepcopy(lun)
length = 2
while len(lun) < k:
tmp = []
for x in tlun:
y = str(x)
xt = int( y[-1] )
a = xt + 1
b = xt - 1
if b != -1:
lun.append(int(y+str(b)))... | p02720 |
k = int(eval(input()))
lun_ls = []
def change_to_num(ls):
ls = list(map(str, ls))
strnum = ''.join(ls)
return int(strnum)
def lun(num):
'''
渡された数が上限行ってなければlun_lsに追加して、次の数で再帰呼出
'''
if num > 3234566667:
return
lun_ls.append(num)
last = num % 10
for nex in ... | k = int(eval(input()))
# やっぱり一旦はglobalで書こ
total_ls = []
def dfs(A):
if int(A) > 3234566667:
return
global total_ls
total_ls.append(int(A))
last = int(A[-1])
if last == 0:
nex = [1,0]
elif last == 9:
nex = [8,9]
else:
nex = [last-1,last,last+1]
... | p02720 |
k=int(eval(input()))
#a,b=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
from collections import deque
q=deque([1,2,3,4,5,6,7,8,9])
ansl=[]
s=1
while len(str(s))<=10:
s=q.popleft()
ansl.append(s)
sl=list(str(s))
last_digit... | k=int(eval(input()))
#n,p=map(int,input().split())
#al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
#素因数分解した結果を2次元配列にして返す
all_list=[]
def rec(d,val):
global all_list
all_list.append(val)
if d==10:
return
for j in range(-1,2,1):
add=... | p02720 |
k = int(eval(input()))
l = set()
def construct(lunnum: str, depth: int, flag: bool):
global l
if depth == 0:
l.add(int(lunnum))
return
m = int(lunnum[-1])
for i in list(range(0, 10)) if flag else set([max(0, m - 1), m, min(9, m + 1)]):
construct(lunnum + str(i), dept... | k = int(eval(input()))
l = set()
# lunnum : 構築中のルンルン数
# depth : 桁数
# flag : 上位桁が全て0かどうかのフラグ
def construct(lunnum: str, depth: int, flag: bool):
global l
if depth == 0:
l.add(int(lunnum))
return
# m = 末尾桁の値
m = int(lunnum[-1])
if flag:
# 上位桁に0以外の数字が無いなら
... | p02720 |
k=int(eval(input()))
a=[]
for i in range(1,10):
a.append(i)
while True:
if k<=len(a):
print((a[k-1]))
break
k-=len(a)
old=[]
old,a=a,old
for x in old:
for i in range(-1,2):
d=x%10+i
if d<0 or d>9:
continue
... | k=int(eval(input()))
a=[i for i in range(1,10)]
for x in a:
if k<=len(a):
break
if x%10!=0:
a.append(10*x+(x%10)-1)
a.append(10*x+(x%10))
if x%10!=9:
a.append(10*x+(x%10)+1)
print((a[k-1])) | p02720 |
import sys
from collections import deque
sys.setrecursionlimit(10**9)
K = int(eval(input()))
lis = deque()
def dfs(nowD, maxD, x):
if nowD == maxD:
lis.append(x)
if len(lis) >= K:
print((lis.pop()))
exit()
else:
y = x%10
x *= 10
... | import sys
sys.setrecursionlimit(10**9)
K = int(eval(input()))
lis = []
def dfs(nowD, maxD, x):
if nowD == maxD:
lis.append(x)
if len(lis) >= K:
print((lis[K-1]))
exit()
else:
y = x%10
x *= 10
if y-1 >= 0:
dfs(nowD+1... | p02720 |
import queue
n = int(eval(input()))
q = queue.Queue()
count=0
p=0
for i in range(1,10):
q.put(i)
while count!=n:
count+=1
a = q.get()
p = a
str_a = str(a)
if str_a[-1]=='0':
q.put(a*10)
q.put(a*10+1)
elif str_a[-1]=='9':
q.put(a*10+8)
q.put(a*... | import queue
k = int(eval(input()))
q = queue.Queue()
for i in range(1,10):
q.put(i)
count = 0
while count < k:
num = q.get()
num_1 = int((str(num))[-1])
if num_1 ==0:
q.put(num*10)
q.put(num*10+1)
elif num_1==9:
q.put(num*10+num_1-1)
q.put(num*10+... | p02720 |
#!/usr/bin/env python3
def main():
def rec(d: int, val: int, all: list):
all.append(val)
if d == 10:
return
for j in range(-1, 2):
add = (val % 10) + j
if add >= 0 and add <= 9:
rec(d + 1, val * 10 + add, all)
K = int(ev... | def main():
from queue import deque
K = int(eval(input()))
q = deque()
for i in range(1, 10):
q.append(i)
for i in range(K - 1):
s = q.popleft()
for j in range(-1, 2):
add = (s % 10) + j
if add >= 0 and add <= 9:
q.append(s... | p02720 |
from collections import deque
K = int(eval(input()))
if K<10:
print(K)
exit()
q = deque([1,2,3,4,5,6,7,8,9])
cnt = 9
while q:
n = q.popleft()
r = n % 10
n *= 10;
for i in range(10):
if abs(r - i) <= 1:
q.append(n + i)
cnt += 1
if cnt == K:
print((n... | from collections import deque
k = int(eval(input()))
if k <= 9:
print(k)
exit()
que = deque([1,2,3,4,5,6,7,8,9])
cnt = len(que)
while cnt < k:
x = que.popleft()
m = x%10
if m != 0:
que.append(10*x+m-1)
cnt+=1
if cnt == k: print((que.pop())); exit();
que.append(10*x+m)
cnt+=1... | p02720 |
from collections import deque
K = int(eval(input()))
q = deque([[1],[2],[3],[4],[5],[6],[7],[8],[9]])
cnt = 0
while cnt != K:
nums = q.popleft()
last = nums[-1]
if last == 9:
tmp = nums.copy()
tmp.append(8)
q.append(tmp)
tmp = nums.copy()
tmp.append(9)
... | K = int(eval(input()))
lunlun = [1,2,3,4,5,6,7,8,9]
p = 0
def lunlun_generator(now_lunlun):
last = now_lunlun%10
if last-1>=0:
yield 10*now_lunlun+last-1
yield 10*now_lunlun+last
if last+1<=9:
yield 10*now_lunlun+last+1
while 1:
for new_lunlun in lunlun_generator(lu... | p02720 |
k=int(eval(input()))
ans=[i for i in range(1,10)]
def dfs(x):
if x>=3234566667:
return
for i in range(max(0,x%10-1),min(10,x%10+2)):
ans.append(10*x+i)
dfs(10*x+i)
for i in range(1,10):
dfs(i)
print((sorted(ans)[k-1])) | k=int(eval(input()))
a=[]
def dfs(v):
if v>3234566667:
return
a.append(v)
for i in range(max(0,v%10-1),min(v%10+2,10)):
dfs(10*v+i)
for i in range(1,10):
dfs(i)
a.sort()
print((a[k-1])) | p02720 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.