input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
sys.setrecursionlimit(10**7)
k = int(eval(input()))
data = [1,2,3,4,5,6,7,8,9]
def dfs(prenum... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
sys.setrecursionlimit(10**7)
k = int(eval(input()))
ans = []
def dfs(string):
if int(string)... | p02720 |
K = int(eval(input()))
queue = []
for i in range(1, 10):
queue.append(i)
while K != 0:
if K <= len(queue):
print((queue[K-1]))
exit(0)
K -= 1
num = queue.pop(0)
if K == 0:
print(num)
exit(0)
o = int(str(num)[-1])
for n in [o-1, o, o+1]:
if n == -1 or n == 10: con... | from collections import deque
K = int(eval(input()))
queue = deque([i for i in range(1,10)])
while K != 0:
if K <= len(queue):
print((queue[K-1]))
exit(0)
K -= 1
num = queue.popleft()
o = int(str(num)[-1])
for n in [o-1, o, o+1]:
if n == -1 or n == 10: continue
queue.append... | p02720 |
#coding:utf-8
def up(nums):
if len(nums) == nums.count(9):
nums = [1] + [0] * len(nums)
return nums
for i in list(reversed(list(range(len(nums))))):
if nums[i] > nums[i-1] or nums[i] == 9:
continue
else:
nums[i] += 1
for j in ... | #coding:utf-8
def up(nums):
if len(nums) == nums.count(9):
nums = [1] + [0] * len(nums)
return nums
for i in list(reversed(list(range(len(nums))))):
if nums[i] > nums[i-1] or nums[i] == 9:
continue
else:
nums[i] += 1
for j in ... | p02720 |
from sys import stdin
import heapq
def main():
input = stdin.readline
K = int(eval(input()))
h = []
for i in range(1,10):
heapq.heappush(h,i)
for i in range(K):
ans = heapq.heappop(h)
if ans % 10 != 0:
heapq.heappush(h,ans * 10 + (an... | from sys import stdin
import heapq
def main():
input = stdin.readline
K = int(eval(input()))
h = []
for i in range(1,10):
h.append(i)
for i in range(K):
ans = h[i]
if ans % 10 != 0:
h.append(ans * 10 + (ans % 10 - 1))
h.append(a... | p02720 |
import heapq
K = int(eval(input()))
def fun(h, n):
tmp = str(n)
if tmp[-1] == '0':
heapq.heappush(h, int(tmp + '0'))
heapq.heappush(h, int(tmp + '1'))
elif tmp[-1] == '9':
heapq.heappush(h, int(tmp + '8'))
heapq.heappush(h, int(tmp + '9'))
else:
hea... | import heapq
K = int(eval(input()))
def fun(h, n):
tmp = n % 10
if tmp != 0:
heapq.heappush(h, 10 * n + tmp - 1)
heapq.heappush(h, 10 * n + tmp)
if tmp != 9:
heapq.heappush(h, 10 * n + tmp + 1)
h = list(range(1, 10))
while K > 0:
n = heapq.heappop(h)
fun(h, n)... | p02720 |
a={0}
_,*s=list(range(10))
while s:
v=s.pop()
a|={v}
for w in range(max(0,v%10-1),min(10,v%10+2)):
w+=v*10
if w<4e9:s+=w,
print((sorted(a)[int(eval(input()))])) | _,*s=list(range(10))
for v in s:s+=[w+v*10for w in range(max(0,v%10-1),min(10,v%10+2))]*(v<4e8)
print((s[int(eval(input()))-1])) | p02720 |
import sys
sys.setrecursionlimit(10**7)
L = []
def lunlun(x, cnt, c):
if cnt == 10:
L.append(int(x))
return
e = int(x[-1])
if c:
for i in range(max(e-1, 0), min(e+2, 10)):
lunlun(x+str(i), cnt+1, 1)
else:
lunlun(x+"0", cnt+1, 0)
for i in range(1, 10):
lunlun(x+str(i... | from collections import deque
que = deque()
L = []
k = int(eval(input()))
for i in range(1, 10):
L.append(str(i))
que.append(str(i))
while len(L) < k:
top = que.popleft()
e = int(top[-1])
for i in range(max(e-1, 0), min(e+2, 10)):
x = top + str(i)
L.append(x)
que.append(x)
ans = L[k-... | p02720 |
from collections import deque
def main():
q=deque()
for i in range(1,10):
q.append((str(i)))
Ans=[]
while q:
s=q.popleft()
if int(s)>3234566667:
continue
Ans.append(int(s))
d=int(s[-1])
if d==0:
q.append(s+'0')
... | from collections import deque
def main():
k=int(eval(input()))
if k<=9:
return k
q=deque()
for i in range(1,10):
q.append(i)
Ans=list(range(1,10))
cnt=9
while cnt<k:
s=q.popleft()
d=s%10
s*=10
if d==0:
q.append(s)
... | p02720 |
from heapq import heapify, heappop, heappush
# 次の桁の生成ルール ex. 1 -> 10, 11, 12
def next_int(n):
nums = {0: [0, 1],
1: [0, 1, 2],
2: [1, 2, 3],
3: [2, 3, 4],
4: [3, 4, 5],
5: [4, 5, 6],
6: [5, 6, 7],
7: [6, 7, 8],
... | from heapq import heapify, heappop, heappush
# 次の桁の生成ルール ex. 1 -> 10, 11, 12
def next_int(n):
nums = {0: [0, 1],
1: [0, 1, 2],
2: [1, 2, 3],
3: [2, 3, 4],
4: [3, 4, 5],
5: [4, 5, 6],
6: [5, 6, 7],
7: [6, 7, 8],
... | p02720 |
from heapq import heapify, heappop, heappush
# 次の桁の生成ルール ex. 1 -> 10, 11, 12
def next_int(n):
nums = {0: [0, 1],
1: [0, 1, 2],
2: [1, 2, 3],
3: [2, 3, 4],
4: [3, 4, 5],
5: [4, 5, 6],
6: [5, 6, 7],
7: [6, 7, 8],
... | from heapq import heapify, heappop, heappush
# 次の桁の生成ルール ex. 1 -> 10, 11, 12
def next_int(n):
nums = {0: [0, 1],
1: [0, 1, 2],
2: [1, 2, 3],
3: [2, 3, 4],
4: [3, 4, 5],
5: [4, 5, 6],
6: [5, 6, 7],
7: [6, 7, 8],
... | p02720 |
from heapq import heapify, heappop, heappush
# 次の桁の生成ルール ex. 1 -> 10, 11, 12
def next_int(n):
nums = {0: [0, 1],
1: [0, 1, 2],
2: [1, 2, 3],
3: [2, 3, 4],
4: [3, 4, 5],
5: [4, 5, 6],
6: [5, 6, 7],
7: [6, 7, 8],
... | from heapq import heapify, heappop, heappush
# 次の桁の生成ルール ex. 1 -> 10, 11, 12
def next_int(n):
if n == 0:
return [0, 1]
elif n == 9:
return [8, 9]
else:
return [n-1, n, n+1]
K = int(eval(input()))
queue = [1, 2, 3, 4, 5, 6, 7, 8, 9] # とりあえず 1 桁目を初期値にとる
heapify(queue)
... | p02720 |
from heapq import heapify, heappush, heappop
def next_num(n):
if n == 0:
return [0, 1]
elif n == 9:
return [8, 9]
else:
return [n-1, n, n+1]
K = int(eval(input()))
lunlun = [1, 2, 3, 4, 5, 6, 7, 8, 9]
heapify(lunlun)
for _ in range(K-1):
now = heappop(lunlun... | from heapq import heapify, heappush, heappop
K = int(eval(input()))
ll = [1, 2, 3, 4, 5, 6, 7, 8, 9]
heapify(ll)
def next_num(X):
n = int(str(X)[-1])
if n == 0:
return (0, 1)
elif n == 9:
return (8, 9)
else:
return (n-1, n, n+1)
for _ in range(K-1):
lli =... | p02720 |
k = int(eval(input()))
lun_list = [1,2,3,4,5,6,7,8,9]
for i in lun_list:
if str(i)[-1] == '0':
for j in range(2):
lun_list.append(int(str(i)+str(j)))
elif str(i)[-1] == '9':
for j in range(8,10):
lun_list.append(int(str(i)+str(j)))
else:
for j in... | k = int(eval(input()))
num_list = [1,2,3,4,5,6,7,8,9]
num_a = ['0', '1']
num_b = ['8', '9']
for i in num_list:
if str(i)[-1] == '0':
for j in num_a:
num_list.append(int(str(i)+j))
elif str(i)[-1] == '9':
for j in num_b:
num_list.append(int(str(i)+j))
el... | p02720 |
#python3
from collections import deque
def main():
k = int(eval(input()))
cand = []
for i in range(1, 10):
cand.append(i)
cnt = 0
dq = deque()
for i in range(1, 10):
dq.append(i)
while len(dq):
v = dq.popleft()
x = v%10
cnt += 1
... | #python3
from collections import deque
def main():
k = int(eval(input()))
cand = []
for i in range(1, 10):
cand.append(i)
cnt = 0
dq = deque()
for i in range(1, 10):
dq.append(i)
while len(dq):
v = dq.popleft()
x = v%10
cnt += 1
... | p02720 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
cnt = 0
def main():
K = int(readline())
cnd = [i for i in range(1, 10)]
dq = deque()
for i in range(1, 10):
dq.append(i)
cnt = 0... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
K = int(readline())
dq = []
for i in range(1, 10):
dq.append(i)
for i in range(K):
v = dq[i]
r = v%10
if r == 9:
dq.app... | p02720 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
K = int(readline())
dq = []
for i in range(1, 10):
dq.append(i)
for i in range(K):
v = dq[i]
r = v%10
if r == 9:
dq.app... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
def main():
K = int(readline())
dq = deque()
cnd = []
for i in range(1, 10):
dq.append(i)
cnd.append(i)
while len(dq)>... | p02720 |
from itertools import product
k = int(eval(input()))
ls = []
ls = [i for i in range(1, 10)]
digit = 1
while len(ls) < k:
for i in range(1, 10):
for j in product([-1, 0, 1], repeat=digit):
num = str(i)
skip = 0
for y in j:
x = int(num[-1])+... | k = int(eval(input()))
ans = [i for i in range(1, 10)]
def generate_lunlun(x):
y = x % 10
if 0 <= y-1:
yield 10*x + y-1
yield 10*x + y
if y+1 < 10:
yield 10*x + y+1
idx = 0
while len(ans) < k:
x = ans[idx]
for i in generate_lunlun(x):
ans.append(i)
... | p02720 |
k = int(eval(input()))
ans = []
def dfs(x):
if x > 10**10:
return 0
else:
ans.append(x)
y = x % 10
for i in range(10):
if abs(y-i) <= 1:
dfs(10*x+i)
for i in range(1, 10):
dfs(i)
ans.sort()
print((ans[k-1])) | k = int(eval(input()))
ans = []
def dfs(x):
if x > 3234566667:
return 0
else:
ans.append(x)
y = x % 10
for i in range(10):
if abs(y-i) <= 1:
dfs(10*x+i)
for i in range(1, 10):
dfs(i)
ans.sort()
print((ans[k-1])) | p02720 |
k = int(eval(input()))
li = [str(i) for i in range(1, 10)]
n = 0
while n < 9:
rep = li[:]
for r in rep:
if r[-1] == "0":
li.append(r+"0")
li.append(r+"1")
elif r[-1] == "9":
li.append(r+"8")
li.append(r+"9")
else:
x = int(r[-1])
li.append(r+str(x-1))
... | from collections import deque
k = int(eval(input()))
def dfs(k):
cnt = 0
stack = deque()
for i in range(1, 10):
stack.append(i)
while cnt <= k:
q = stack.popleft()
ans.append(q)
cnt += 1
l = q % 10
for x in range(max(0, l - 1), min(10, l + 2)):
stack.append(q * 10 + ... | p02720 |
import queue
k = int(eval(input()))
q = queue.Queue()
for i in range(1,10):
q.put(i)
for i in range(1,k):
l = q.get()
m = l % 10
if (m != 0):
q.put(l * 10 + m - 1)
q.put(l * 10 + m)
if (m != 9):
q.put(l * 10 + m + 1)
print((q.get())) | from collections import deque
k = int(eval(input()))
q = deque([1,2,3,4,5,6,7,8,9])
for i in range(1,k):
l = q.popleft()
if (len(q) < k):
m = l % 10
if (m != 0):
q.append(l * 10 + m - 1)
q.append(l * 10 + m)
if (m != 9):
q.append(l * 10 + m ... | p02720 |
N = int(eval(input()))
tmp = [i for i in range(1, 10)]
ans = list(tmp)
for i in range(10):
tmp2 = []
for x in tmp:
k = int(str(x)[-1])
if k != 0:
ans.append(10*x-1 + k)
tmp2.append(10*x-1 + k)
if k != 9:
tmp2.append(10*x+1 + k)
... | import collections
K = int(eval(input()))
q = collections.deque([i for i in range(1, 10)])
count = 0
while(q):
count += 1
x = q.popleft()
if count == K:
print(x)
break
if x % 10 != 0:
q.append(x*10 + (x % 10 - 1))
q.append(x*10 + (x % 10))
if x % 10 != 9:
... | p02720 |
K = int(eval(input()))
d = [1,2,3,4,5,6,7,8,9]
if K <= 9:
print(K)
exit()
cnt = 9
while cnt < K:
_ = d.pop(0)
matsubi = _%10
if matsubi == 0:
d.append(_*10+matsubi)
cnt += 1
if cnt == K:
print((d[-1]))
exit()
d.append(_*10+matsubi+1)
cnt += 1
if cnt... | K = int(eval(input()))
d = [1,2,3,4,5,6,7,8,9]
if K <= 9:
print(K)
exit()
cnt = 9
while cnt < K:
_ = d.pop(0)
matsubi = _%10
if matsubi == 0:
d.append(_*10+matsubi)
d.append(_*10+matsubi+1)
cnt += 2
elif matsubi == 9:
d.append(_*10+matsubi-1)
d.append(_*10+matsub... | p02720 |
k = int(eval(input()))
nums = []
def inc(num):
if num > 3234566667:
return None
if num <= 3234566667:
nums.append(num)
num_str = str(num)
end = num_str[-1:]
end_num = int(end)
if end_num < 9:
inc(int(num_str + str(end_num + 1)))
inc(int(num_str + ... | k = int(eval(input()))
nums = []
def inc(num):
if num > 3234566667:
return None
if num <= 3234566667:
nums.append(num)
end = str(num)[-1:]
end_num = int(end)
if end_num < 9:
inc(num * 10 + end_num + 1)
inc(num * 10 + end_num)
if end_num > 0:
... | p02720 |
z = int(eval(input()))
l = []
for i in range(1,10):
l.append(i)
for j in range(max(0,i-1),min(10,i+2)):
l.append(int(str(i)+str(j)))
for k in range(max(j-1,0),min(10,j+2)):
l.append(int(str(i)+str(j)+str(k)))
for m in range(max(k-1,0),min(10,k+2)):
... | from collections import deque
k = int(eval(input()))
s = deque([1,2,3,4,5,6,7,8,9])
for i in range(k):
c = s.popleft()
d = int(str(c)[-1])
for j in range(max(0,d-1),min(10,d+2)):
s.append(int(str(c)+str(j)))
print(c) | p02720 |
"""
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools impo... | """
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools impo... | p02720 |
from collections import deque
k = int(eval(input()))
Q = deque(list(range(1, 10)))
for _ in range(k):
x = Q.popleft()
y = x % 10
z = 10*x + y
if y != 0:
Q += [z-1]
Q += [z]
if y != 9:
Q += [z+1]
print(x) | from collections import deque
k = int(eval(input()))
Q = deque(list(range(1, 10))) #るんるん数を格納するキュー
# Q: 1 2 3 4 5 6 7 8 9
for i in range(k):
x = Q.popleft()
#x = 1 <-- Q: 2 3 4 5 6 7 8 9
last_digit = x % 10 # 1 一番目の桁の値
if last_digit == 0:
Q.append(10*x + 0)
Q.append(10*x + 1)
... | p02720 |
from collections import deque
k = int(eval(input()))
Q = deque(list(range(1, 10))) #るんるん数を格納するキュー
# Q: 1 2 3 4 5 6 7 8 9
for i in range(k):
x = Q.popleft()
#x = 1 <-- Q: 2 3 4 5 6 7 8 9
last_digit = x % 10 # 1 一番目の桁の値
if last_digit == 0:
Q.append(10*x + 0)
Q.append(10*x + 1)
... | from collections import deque
k = int(eval(input()))
Q = deque(list(range(1, 10))) #るんるん数を格納するキュー
# Q: 1 2 3 4 5 6 7 8 9
for i in range(k):
x = Q.popleft()
#x = 1 <-- Q: 2 3 4 5 6 7 8 9
last_digit = x % 10 # 1 一番目の桁の値
z = 10*x + last_digit #11
if last_digit != 0:
Q.append(z-1)
# Q: 2... | p02720 |
# 解説放送
k = int(eval(input()))
a = [i+1 for i in range(9)]
while 1:
if k <= len(a):
print((a[k-1]))
exit()
k -= len(a)
old = []
a, old = old, a
for x in old:
for i in range(-1, 2):
d = x % 10 + i
if d < 0 or d > 9: continue
... | # 解説PDF
from collections import deque
k = int(eval(input()))
que = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for i in range(k-1):
x = que.popleft()
y = x % 10
if y != 0:
que.append(10*x+y-1)
que.append(10*x+y)
if y != 9:
que.append(10*x+y+1)
ans = que.popleft()
print(... | p02720 |
from collections import deque
k = int(eval(input()))
cnt = 0
q = deque()
for i in range(1, 10):
q.append((str(i), i))
cnt += 1
if cnt == k:
print((str(i)))
exit()
while q:
lun, num = q.popleft()
for i in range(num - 1, num + 2):
if i < 0 or i >9:continue
... | from collections import deque
def bfs(k):
lunlun = []
q = deque()
count = 0
for i in range(1, 10):
lunlun.append(i)
q.append(i)
count += 1
if count >= k:return lunlun[k - 1]
while True:
num = q.popleft()
tail = num % 10
for i in [-... | p02720 |
from collections import deque
k = int(eval(input()))
d = deque([1,2,3,4,5,6,7,8,9])
ans = []
while len(ans) < k:
a = d.popleft()
ans.append(a)
l = [a%10-1, a%10, a%10+1]
for i in l:
if i==-1 or i==10:
continue
d.append(a*10 + i)
print((ans[k-1])) | from collections import deque
k = int(eval(input()))
d = deque([1,2,3,4,5,6,7,8,9])
for i in range(k):
a = d.popleft()
l = [a%10-1, a%10, a%10+1]
for j in l:
if j==-1 or j==10:
continue
d.append(a*10 + j)
print(a) | p02720 |
def gen_lunlun(digit, li):
if len(li) == digit:
lunluns.append(''.join(map(str, li)))
return
min_num = max(0, li[-1] - 1)
max_num = min(9, li[-1] + 1)
for i in range(min_num, max_num + 1):
gen_lunlun(digit, li + [i])
k = int(eval(input()))
lunluns = []
for d in ra... | from collections import deque
def nth_ll(k):
if k < 10:
return k
queue = deque([i for i in range(1, 10)])
cnt = 9
while True:
n = queue.popleft()
for i in range(-1 if n % 10 != 0 else 0, 2 if n % 10 != 9 else 1):
queue.append(10 * n + n % 10 + i)
... | p02720 |
import sys
sys.setrecursionlimit(10 ** 5)
def dfs(v):
ans.append(v)
if v > 1_000_000_000:
return
for d in range(10):
if abs(d - v % 10) <= 1:
nv = v * 10 + d
dfs(nv)
K = int(eval(input()))
ans = []
[dfs(i) for i in range(1, 10)]
print((sorted(an... | import sys
sys.setrecursionlimit(10 ** 5)
def dfs(v):
if v > 3234566667:
return
ans.append(v)
d = v % 10
if d - 1 >= 0:
dfs(v * 10 + d - 1)
dfs(v * 10 + d)
if d + 1 < 10:
dfs(v * 10 + d + 1)
K = int(eval(input()))
ans = []
[dfs(i) for i in range(1,... | p02720 |
import sys
sys.setrecursionlimit(10 ** 5)
def dfs(v):
if v > 3234566667:
return
ans.append(v)
d = v % 10
if d - 1 >= 0:
dfs(v * 10 + d - 1)
dfs(v * 10 + d)
if d + 1 < 10:
dfs(v * 10 + d + 1)
K = int(eval(input()))
ans = []
[dfs(i) for i in range(1,... | def is_good(mid, key):
S = list(map(int, str(mid)))
N = len(S)
dp = [[[0] * 11 for _ in range(2)] for _ in range(N + 1)]
dp[1][1][10] = 1
for k in range(1, S[0]):
dp[1][1][k] = 1
dp[1][0][S[0]] = 1
for i in range(1, N):
for k in range(1, 11):
dp[i + 1][1... | p02720 |
def is_lunlun(n):
m = str(n)
for i in range(1,len(m)):
if abs(int(m[i]) - int(m[i-1])) > 1:
return False
return True
def main():
K = int(eval(input()))
A = [format(str(i),"0>5") for i in range(100000) if is_lunlun(i)]
B = [int(a1+a2) for a1 in A for a2 in A if int(... | def main():
K = int(eval(input()))
from collections import deque
A = deque([1,2,3,4,5,6,7,8,9])
a = 0
while True:
x = A.popleft()
xmod10 = x % 10
if xmod10 != 0:
A.append(10*x + xmod10 - 1)
A.append(10*x + xmod10)
if xmod10 != 9:
... | p02720 |
import sys
from collections import deque
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, d=DVSR): return pow(x, d - 2, d)
def DIV(x, y, d=DVSR): return (x * INV(y, d)) % d
def LI(): return [int(x) for x i... | import sys
from collections import deque
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, d=DVSR): return pow(x, d - 2, d)
def DIV(x, y, d=DVSR): return (x * INV(y, d)) % d
def LI(): return [int(x) for x i... | p02720 |
n=int(eval(input()))
import queue
q=queue.Queue()
for i in range(1,10):
q.put(i)
while n!=1:
x=q.get();k=x%10
for j in [10*x+i for i in range(max(0,k-1),min(10,k+2))] :
q.put(j)
n-=1
print((q.get())) | n=int(eval(input()))
import queue
q=queue.Queue()
for i in range(1,10):
q.put(i)
while n!=1:
x=q.get();k=x%10
for i in range(max(0,k-1),min(10,k+2)) :
q.put(10*x+i)
n-=1
print((q.get())) | p02720 |
K = int(eval(input()))
numbers = set([])
q = set(list(map(str, [1, 2, 3, 4, 5, 6, 7, 8, 9])))
# print(f'{q=}')
while len(numbers) <= 100000: # 10**8:
# print('test')
qq = set([])
for i in q:
# print(f'{i=}')
if len(i) == 1:
if i == '0':
n = i + '0'
... | K = int(eval(input()))
numbers = set([])
q = set([1, 2, 3, 4, 5, 6, 7, 8, 9])
# print(f'{q=}')
while len(numbers) <= 100000: # 10**8:
# print('test')
qq = set([])
for i in q:
# print(f'{i=}')
if i % 10 != 0:
n = i * 10 + (i % 10) - 1
qq.add(n)
i... | p02720 |
cands = [1, 2, 3, 4, 5, 6, 7, 8, 9]
def add_v(v):
global cands
global K
v = str(v)
v0 = int(v[-1])
if v0 == 0:
cands += [int(v+'0'), int(v+'1')]
K -=2
elif v0 == 9:
cands += [int(v+'8'), int(v+'9')]
K -= 2
else:
cands += [int(v+str(v0-1)), int(v+str(v0)), int(v+str(v0+1)... | cands = [1, 2, 3, 4, 5, 6, 7, 8, 9]
def add_v(v):
global cands
global K
v0 = v % 10
if v0 == 0:
cands += [v*10, v*10+1]
K -=2
elif v0 == 9:
cands += [v*10+8, v*10+9]
K -= 2
else:
cands += [v*10+v0-1, v*10+v0, v*10+v0+1]
K -= 3
K = int(eval(input()))
idk = K
K -= 9... | p02720 |
from collections import deque
li=[i for i in range(1,10)]
def bfs(K):
d=deque()
for i in range(1,10):
d.append(str(i))
while(len(li)<K):
s=d[0]
d.popleft()
now=[int(s+s[-1])]
if(s[-1]!='0'):
now.append(int(s+str(int(s[-1])-1)))
if(s[-1]... | from collections import deque
lunlun=[i for i in range(1,10)]
def bfs(K):
d=deque([1,2,3,4,5,6,7,8,9])
while(len(lunlun)<K):
s=d[0]
d.popleft()
n=[]
if(s%10!=0):
n.append((s%10-1)+s*10)
n.append(s%10+s*10)
if(s%10!=9):
n.append(... | p02720 |
from collections import deque
k = int(eval(input()))
queue = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for _ in range(k):
num = queue.popleft()
a = num // 10
b = num % 10
if b != 0:
queue.append(num*10 + b-1)
queue.append(num*10 + b)
if b != 9:
queue.append(... | from collections import deque
k = int(eval(input()))
queue = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for _ in range(k):
num = queue.popleft()
x = num % 10
if x != 0:
queue.append(num*10 + x-1)
queue.append(num*10 + x)
if x != 9:
queue.append(num*10 + x+1)
print(... | p02720 |
def solve(K):
lun = [0]
def nextLunlun(arr, d=0):
arr[d] += 1
if arr[d] == 10:
if d + 1 == len(arr):
arr.append(1)
arr[d] = 0
return arr
else:
arr = nextLunlun(arr, d + 1)
arr[d] ... | # 解説を参考に作成
from collections import deque
def solve(K):
lunlun = deque([i for i in range(1, 10)])
ans = 0
for _ in range(K):
ans = lunlun.popleft()
x = ans * 10 + ans % 10
if x % 10 != 0:
lunlun.append(x - 1)
lunlun.append(x)
if x % 10 != 9... | p02720 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")
def solve(K: int):
X = set()
def rec(keta, val):
X.add(val)
if keta == 10:
return
for j in range(-1, 2):
add = (val % 10)+j
if add >= 0 and add <= 9... | #!/usr/bin/env python3
import sys
from collections import deque
sys.setrecursionlimit(10**8)
INF = float("inf")
def solve(K: int):
h = deque([])
for i in range(1, 10):
h.append(i)
for i in range(K-1):
s = h.popleft()
for j in range(-1, 2):
add = (s %... | p02720 |
K=int(eval(input()))
from collections import deque
d=deque([1,2,3,4,5,6,7,8,9])
k=1
while True:
a=d.popleft()
if k==K:
print(a)
exit()
else:
k+=1
r=a%10
if r==0:
for i in [0,1]:
temp=a*10+i
d.append(temp)
elif r==9:
... | K=int(eval(input()))
from collections import deque
d=deque([1,2,3,4,5,6,7,8,9])
k=1
while True:
a=d.popleft()
if k==K:
print(a)
exit()
else:
k+=1
r=a%10
if 0<r<=9:
temp = a * 10 + (r -1)
d.append(temp)
temp=a*10+r
d.append(temp)
... | p02720 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
f... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
f... | p02720 |
def d_lunlun_number():
import sys
sys.setrecursionlimit(10**6)
K = int(eval(input()))
ans = []
def dfs(num, current, digit_max):
if current == digit_max:
ans.append(num)
return None
for n in range(10):
if abs((num % 10) - n) >= 2:
... | def d_lunlun_number():
from collections import deque
K = int(eval(input()))
queue = deque(list(range(1, 10)))
ans = -1
for _ in range(K):
ans = queue.popleft()
lsd = ans % 10 # least significant digit
if lsd != 0:
queue.append(10 * ans + (lsd - 1))
... | p02720 |
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
k = ni()
LIMIT = 12
luns = []
def make_lunlun(l):
if len(l) == LIMIT:
return
luns.append(int(''.join(list(map(str,l)))))
if l[-1]!=0:
make_lunlun(l+[... | ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
k = ni()
luns = []
def make_lunlun(l):
if l > 3234566667:
return
luns.append(l)
last = l-l//10*10
if last!=0:
make_lunlun(l*10 + last-1)
m... | p02720 |
k=int(eval(input()))
cur=1
ans=[]
while len(ans)<k:
num=str(cur)
n=len(num)
flag=True
pos=-1
# print(num,end=' num\n')
for i in range(n-1):
if abs(int(num[i])-int(num[i+1]))>1:
pos=i+1
flag=False
break
# print(flag)
if flag==True:
... | k=int(eval(input()))
cur=1
ans=-1
cnt=0
while cnt<k:
num=str(cur)
n=len(num)
flag=True
pos=-1
# print(num,end=' num\n')
for i in range(n-1):
if abs(int(num[i])-int(num[i+1]))>1:
pos=i+1
flag=False
break
# print(flag)
if flag==True... | p02720 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
n = 0
def dfs(vec, d):
nonlocal n
if d == 0:
n += 1
if ... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
queue = deque(list(range(1, 10)))
for _ in range(K):
n = queu... | p02720 |
import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
queue = deque(list(range(1, 10)))
for _ in range(K):
n = queu... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
queue = deque(list(range(1, 10)))
for _ in range(K):
n = queu... | p02720 |
import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
queue = deque(list(range(1, 10)))
for _ in range(K):
n = queu... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
vec = list(range(1, 10))
for i in range(K):
tail = vec[i] % 10
n10 = vec[i] * 10
... | p02720 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
vec = list(range(1, 10))
for i in range(K):
tail = vec[i] % 10
n10 = vec[i] * 10
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
vec = list(range(1, 10))
for i in range(K):
tail = vec[i] % 10
n10 = vec[i] * 10
... | p02720 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
vec = list(range(1, 10))
for i in range(K):
tail = vec[i] % 10
if tail == 0:
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
vec = list(range(1, 10))
for i in range(K):
tail = vec[i] % 10
n10 = vec[i] * 10
... | p02720 |
k = int(eval(input()))
A = [i for i in range(1, 10)]
while k:
if k <= len(A):
print((A[k-1]))
exit()
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()))
RunRun = [i for i in range(1, 10)]
while True:
if k <= len(RunRun):
print((RunRun[k-1]))
exit()
k -= len(RunRun)
now = []
now, RunRun = RunRun, now
for r in now:
for i in range(-1, 2):
tmp = r % 10 + i
... | p02720 |
from collections import deque
K = int(eval(input()))
que = deque(['1', '2', '3', '4', '5', '6', '7', '8', '9'])
while K:
if K == 1:
ans = que.popleft()
break
K -= 1
v = que.popleft()
if v[-1] == '0':
que.append(v + '0')
que.append(v + '1')
elif v[-1] =... | from collections import deque
def main():
K = int(eval(input()))
que = deque(['1', '2', '3', '4', '5', '6', '7', '8', '9'])
while K:
if K == 1:
ans = que.popleft()
break
K -= 1
v = que.popleft()
if v[-1] == '0':
que.append(... | p02720 |
from collections import deque
def main():
K = int(eval(input()))
que = deque(['1', '2', '3', '4', '5', '6', '7', '8', '9'])
while K:
if K == 1:
ans = que.popleft()
break
K -= 1
v = que.popleft()
if v[-1] == '0':
que.append(... | from collections import deque
def main():
K = int(eval(input()))
que = deque([i for i in range(1, 10)])
while K:
if K == 1:
ans = que.popleft()
break
K -= 1
v = que.popleft()
if v % 10 == 0:
que.append(v * 10)
qu... | p02720 |
def dfs(s):
d=len(s)
if d>10:
return
if s!='':
if s[0]!='0':
num.add(int(s))
for c in '0123456789':
if s=='':
dfs(s+c)
else:
if abs(int(s[-1])-int(c))<=1:
dfs(s+c)
k=int(eval(input()))
num=set()
... | from collections import deque
k=int(eval(input()))
q=deque([i for i in range(1,10)])
ans=0
cnt=0
while 1:
x=q.popleft()
cnt+=1
if cnt==k:
ans=x
break
xmod10 = x % 10
if xmod10 != 0:
q.append(10*x+(xmod10-1))
q.append(10*x+(xmod10))
if xmod10 != 9:
... | p02720 |
def dfs(s,l):
if s!="":
if len(s)>10 or s[0]=="0":
return
if s!="":
l.append(int(s))
for c in "0123456789":
if s!="":
if abs(int(s[-1])-int(c))<=1:
dfs(s+c,l)
else:
if c!="0":
dfs(s+c,l)
k=int(eval(input()))
l=[]
dfs("",l)
l.sort()
print((l[k-1]... | import sys
sys.setrecursionlimit(10000000)
def dfs(s):
if len(s)==11:
return
if s!="":
a.append(int(s))
for c in "0123456789":
if s=="" and c=="0":continue
if len(s)>0:
if abs(ord(s[-1])-ord(c))<=1:
dfs(s+c)
else:
dfs(s+c)
k=int(eval(input()))
a=[]
dfs("")... | p02720 |
import sys
sys.setrecursionlimit(10000000)
def dfs(s):
if len(s)==11:
return
if s!="":
a.append(int(s))
for c in "0123456789":
if s=="" and c=="0":continue
if len(s)>0:
if abs(ord(s[-1])-ord(c))<=1:
dfs(s+c)
else:
dfs(s+c)
k=int(eval(input()))
a=[]
dfs("")... | import sys
sys.setrecursionlimit(10000000)
def dfs(s):
if len(s)==11:
return
if s!="":
a.append(int(s))
for c in "0123456789":
if s=="" and c=="0":continue
if s!="":
if abs(ord(c)-ord(s[-1]))<=1:
dfs(s+c)
else:
dfs(s+c)
k=int(eval(input()))
a=[]
dfs("")
a... | p02720 |
import collections
k = int(eval(input()))
n = 10**10
li = list(range(1,10))
num_li = li[:]
q = collections.deque(li)
count = 0
for i in range(1,n):
num = str(q.popleft())
go = int(num[-1])
if go != 0:
numa = num + str(go - 1)
num_li.append(int(numa))
q.append(int(num... | import collections
k = int(eval(input()))
li = [str(i) for i in range(1,10)]
st_li = li[:]
q = collections.deque(li)
count = 0
n = 10 ** 10
for i in range(1, n):
a = q.popleft()
num = int(a[-1])
if num != 0:
aa = a + str(num-1)
st_li.append(aa)
q.append(aa)
... | p02720 |
import sys
from collections import deque
def input():
return sys.stdin.readline().strip()
def main():
K = int(eval(input()))
ans = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for _ in range(K - 1):
a = ans.popleft()
if a % 10 == 0:
ans.append(a * 10)
ans... | import sys
from collections import deque
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(20000000)
MOD = 10 ** 9 + 7
INF = float("inf")
def main():
K = int(eval(input()))
q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for i in range(K):
d = q.popleft()
... | p02720 |
k=int(eval(input()))
L=[]
def f(d,now,L):
L.append(now)
if d==10:
return
for j in range(-1,2):
v=now%10+j
if 0<=v<=9:
f(d+1,now*10+v,L)
for l in range(1,10):
f(1,l,L)
L.sort()
print((L[k-1]))
| from collections import deque
k=int(eval(input()))
lunlun=deque(i for i in range(1,10))
for _ in range(k-1):
p=lunlun.popleft()
if p%10!=0:
lunlun.append(10*p+p%10-1)
lunlun.append(10*p+p%10)
if p%10!=9:
lunlun.append(10*p+p%10+1)
print((lunlun.popleft())) | p02720 |
from sys import stdin,setrecursionlimit
k = int(stdin.readline().rstrip())
li = [i for i in range(1,10)]
#ルンルン最初の数
def runrun(before,kazu):
if before == 0:
li.append(int(kazu+str(before+1)))
li.append(int(kazu+str(before)))
elif before == 9:
li.append(int(kazu+str(before-1)))
... | from queue import deque
k = int(eval(input()))
que = deque()
for i in range(1,10):
que.append(i)
for i in range(k):
if i == (k-1):
print((que.popleft()))
exit()
now = que.popleft()
if now%10 != 0:
que.append(now*10+now%10-1)
que.append(now*10+now%10)
if n... | p02720 |
k=int(eval(input()))
ans=[[i for i in range(1,10)]]
d=9
while d<k:
ans.append([])
for i in ans[-2]:
x=str(i)
y=int(x[0])
if y==1:
ans[-1].append(str(y)+x)
ans[-1].append(str(y+1)+x)
elif 2<=y<=8:
ans[-1].append(str(y-1)+x)
... | k=int(eval(input()))
ans=[[i for i in range(1,10)]]
d=9
while d<k:
ans.append([])
for i in ans[-2]:
x=str(i)
z=int(x[-1])
if z==0:
ans[-1].append(x+str(z))
ans[-1].append(x+str(z+1))
elif 1<=z<=8:
ans[-1].append(x+str(z-1))
... | p02720 |
k=int(eval(input()))
ans=[[i for i in range(1,10)]]
d=9
while d<k:
ans.append([])
for i in ans[-2]:
x=str(i)
z=int(x[-1])
ans[-1].append(x+str(z))
if z<=8:
ans[-1].append(x+str(z+1))
if z>=1:
ans[-1].append(x+str(z-1))
d+=len(ans[-... | k=int(eval(input()))
ans=[[i for i in range(1,10)]]
d=9
while d<k:
ans.append([])
for i in ans[-2]:
x=str(i)
z=int(x[-1])
ans[-1].append(x+str(z))
if z<=8:
ans[-1].append(x+str(z+1))
if z>=1:
ans[-1].append(x+str(z-1))
d+=len(ans[-... | p02720 |
from collections import deque
k = int(eval(input()))
queue = [1, 2, 3, 4, 5, 6, 7, 8, 9]
queue = deque(queue)
cnt = 0
while cnt < k:
cnt += 1
a = queue.popleft()
hitoketa = a % 10
kouho = [hitoketa - 1, hitoketa, hitoketa + 1]
for b in kouho:
if b >= 0 and b <= 9:
q... | from collections import deque
k = int(eval(input()))
LL = [i for i in range(1, 10)]
LL = deque(LL)
for j in range(k):
num = LL.popleft()
amari = num % 10
kouho = [amari - 1, amari, amari + 1]
for nn in kouho:
if nn >= 0 and nn < 10:
LL.append(10 * num + nn)
print(num)
| p02720 |
import sys
N, K = list(map(int, sys.stdin.readline().split()))
if K == 0:
print((N*N))
sys.exit()
# b は K 以上
# a は b * c + K <= a < b * (c+1)
ans = 0
for i in range(1, N+1):
# print(N // i, (i - K), max(N % i - K, 0))
tmp = (N // i) * max(i - K, 0) + max(N % i + 1 - K, 0)
ans += tmp... | import sys
N, K = list(map(int, sys.stdin.readline().split()))
if K == 0:
print((N*N))
sys.exit()
ans = 0
for b in range(K+1, N+1):
r = N // b
# tmp = (b - K) * r
# tmp2 = (N % b + 1 - K)
# print(b, tmp, tmp2)
tmp = (b - K) * r + max(0, N % b + 1 - K)
ans += tmp
prin... | p03420 |
import sys
n,k = list(map(int,input().split()))
#if k == 0:
# print(n**2)
# sys.exit
count = 0
for i in range(1,n+1):
tmp_count = max(0,i - k)
#print(i,n // i,tmp_count,(n // i)* tmp_count + max(0,(n % k)-k+1),max(0,(n % i)-k+1),n % i)
count += (n // i)* tmp_count + max(0,(n % i)-k+1)
if k... | import sys
n,k = list(map(int,input().split()))
#if k == 0:
# print(n**2)
# sys.exit
count = 0
for i in range(1,n+1):
tmp_count = max(0,i - k)
#print(i,n // i,tmp_count,(n // i)* tmp_count + max(0,(n % k)-k+1),max(0,(n % i)-k+1),n % i)
count += (n // i)* tmp_count + max(0,(n % i)-k+1)
if k... | p03420 |
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
res = 0
for i in range(1, N + 1):
u = max(i - K, 0)
v = N // i
x = max(N % i - K + 1, 0)
res += u * v + x - (K == 0)
#print(i, u, v, x)
#print(res)
print(res) | import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
res = 0
for x in range(K + 1, N + 1):
res += (N // x) * (x - K) + max(0, N % x - K + (K > 0))
#print(x, res)
print(res) | p03420 |
n, k = list(map(int, input().split()))
if k == 0:
print((n**2))
exit()
ans = 0
for i in range(1, n+1):
if i <= k:
continue
q, r = divmod(n, i)
if r < k:
ans += (i-k)*q
else:
ans += (i-k)*q + (r-k+1)
print(ans)
| n, k = list(map(int, input().split()))
if k == 0:
ans = n**2
print(ans)
exit()
ans = 0
for b in range(1, n+1):
if b <= k:
continue
q, r = divmod(n, b)
if r < k:
ans += ((b-1)-k+1)*q
else:
ans += ((b-1)-k+1)*q + r-k+1
print(ans)
| p03420 |
def calc0(N, K):
r = 0
for a in range(1, N + 1):
for b in range(1, N + 1):
if a % b >= K:
print((a, b, a % b))
r += 1
return r
def calc1(N, K):
result = 0
for i in range(K, N):
for x in range(i + 1, N + 1):
if i > ... | def calc(N, K):
if K == 0:
return N**2
result = 0
for b in range(K + 1, N + 1):
n, m = divmod(N, b)
result += (b - K) * n
if m >= K:
result += m - K + 1
return result
N, K = [int(_) for _ in input().split()]
print((calc(N, K)))
| p03420 |
n,k=list(map(int,input().split()))
ans=0
for b in range(k+1,n+1):
ans+=(n//b)*(b-k)
m=n%b
ans+=max(0,m-(k-1))
if k==0:ans-=n
print(ans) | n,k=list(map(int,input().split()))
ans=0
for b in range(k+1,n+1):
m=(n//b)
mm=n%b
ans+=m*(b-k)
ans+=max(0,mm-k+1)
print((ans-(n if k==0 else 0))) | p03420 |
n, k = list(map(int, input().split()))
ans = 0
if k == 0:
ans = n*n
else:
for i in range(1, n+1):
ans += n//i * max(i-k, 0)
a = n//i * max(i-k, 0)
b = 0
if i >= k and n % i != 0:
ans += max(0, (n%i+1)-k)
b = max(0, (n%i+1)-k)
print(ans)
| n, k = list(map(int, input().split()))
ans = 0
if k == 0:
ans = n * n
else:
for i in range(1, n + 1):
ans += n // i * max(i - k, 0)
if i >= k and n % i != 0:
ans += max(0, (n % i + 1) - k)
print(ans)
| p03420 |
N, K = list(map(int, input().split()))
ans = 0
for b in range(K + 1, N + 1):
p = N // b
q = p * (b - K) + max(N % b - K + 1, 0)
ans += q if K > 0 else q-1
print(ans)
| N,K=list(map(int,input().split()));print((sum(N//b*(b-K)+max(N%b+1-K,0)-(K<1)for b in range(K+1,N+1)))) | p03420 |
N, K = list(map(int, input().split()))
if K == 0:
print((N**2))
exit()
ans = 0
for div in range(K + 1, N + 1):
cnt = N // div
ans += cnt * (div - K)
ans += max(0, (N % div) - K + 1)
print(ans) | N, K = list(map(int, input().split()))
if K == 0:
print((N**2))
exit()
ans = 0
for d in range(K + 1, N + 1):
ans += (N // d) * (d - K)
ans += max(0, N % d - K + 1)
print(ans) | p03420 |
n, k = list(map(int, input().split(' ')))
result = 0
for i in range(1, n+1):
p = n//i
result += p*max(0,i-k)
result += max(0, n%i-k+1)
if k == 0:
result -= 1
print(result) | def main():
n, k = list(map(int, input().split(' ')))
result = 0
for i in range(1, n+1):
p = n//i
result += p*max(0,i-k)
result += max(0, n%i-k+1)
if k == 0:
result -= 1
print(result)
main() | p03420 |
def main():
n, k = list(map(int, input().split(' ')))
result = 0
for i in range(1, n+1):
p = n//i
result += p*max(0,i-k)
result += max(0, n%i-k+1)
if k == 0:
result -= 1
print(result)
main() | def main():
n, k = list(map(int, input().split(' ')))
result = 0
for i in range(1, n+1):
p = n//i
result += p*max(0,i-k)
result += max(0, n%i-k+1)
if k == 0:
result -= n
print(result)
main() | p03420 |
def main():
n, k = list(map(int, input().split(' ')))
result = 0
for i in range(1, n+1):
p = n//i
result += p*max(0,i-k)
result += max(0, n%i-k+1)
if k == 0:
result -= n
print(result)
main() | def main():
n, k = list(map(int, input().split(' ')))
result = 0
for i in range(1, n+1):
result += n//i*max(0,i-k) + max(0, n%i-k+1)
if k == 0:
result -= n
print(result)
main() | p03420 |
def main():
n, k = list(map(int, input().split(' ')))
result = 0
for i in range(1, n+1):
result += n//i*max(0,i-k) + max(0, n%i-k+1)
if k == 0:
result -= n
print(result)
main() | def main():
n, k = list(map(int, input().split(' ')))
result = [n//i*max(0,i-k) + max(0, n%i-k+1) for i in range(1, n+1)]
if k == 0:
print((sum(result)-n))
else:
print((sum(result)))
main() | p03420 |
n, k = list(map(int, input().split()))
ans = 0
for b in range(k + 1, n + 1):
ans += ((n // b) * max(0, b - k)) + max(0, (n % b) - k + 1)
if k == 0:
ans = n ** 2
print(ans)
| n, k = list(map(int, input().split()))
ans = 0
for b in range(k + 1, n + 1):
ans += ((n // b) * (b - k)) + max(0, (n % b) - k + 1)
if k == 0:
ans = n ** 2
print(ans)
| p03420 |
import math
n, k = list(map(int, input().split()))
res = 0
for b in range(1, n + 1):
res += math.floor(n / b) * max(0, b - k) + max(0, n % b - k + 1)
if k == 0:
res = n ** 2
print(res)
| import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
if k == 0:
print((n ** 2))
exit()
res = 0
for b in range(1, n + 1):
res += n // b * max(0, b - k... | p03420 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
if k == 0:
print((n ** 2))
exit()
res = 0
for b in range(1, n + 1):
res += n // b * max(0, b - k... | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
if k == 0:
print((n ** 2))
exit()
res = 0
for b in range(1, n + 1):
res += (n // b) * max(0, (b - k))
res += max(0, (... | p03420 |
n, k = [int(i) for i in input().split()]
ans = 0
if k == 0:
ans = n*n
else:
for b in range(k+1, n+1):
# number of perfect cycle
ans += max(n // b, 0) * (b-k)
r = n % b
ans += max(r - k+1, 0)
print(ans) | n, k = [int(i) for i in input().split()]
ans = 0
if k == 0:
ans = n*n
else:
for b in range(k+1, n+1):
# number of perfect cycle
ans += n // b * (b-k)
r = n % b
ans += max(r - k+1, 0)
print(ans) | p03420 |
n,k=list(map(int,input().split()))
a=0
for b in range(1,n+1):
if b>k:
a+=(b-k)*(n//b)+(n%b-k+1)*(n%b>k-1)-1*(k==0)
print(a) | n,k=list(map(int,input().split()))
a=0
for b in range(k+1,n+1):
a+=(b-k)*(n//b)+(n%b-k+1)*(n%b>k-1)-1*(k==0)
print(a)
| p03420 |
n,k = list(map(int,input().split()))
ans =0
if k==0:
print((n**2))
exit()
for i in range(k+1,n+1):
ans+=(n//i)*(i-k) + max(0,n%i-k+1)
print(ans) | def solve():
n,k = list(map(int,input().split()))
res = 0
for i in range(k+1,n+1):
res+=(i-k)*(n//i)
if n%i>=k:
if k==0:
res+=n%i
else:
res+=n%i-k+1
print(res)
if __name__=='__main__':
solve() | p03420 |
N,K = list(map(int,input().split()))
if K == 0:
print((N*N))
exit()
ans = 0
for b in range(1,N+1):
cycle,rem = divmod(N,b)
ans += cycle * max(0, b-K)
ans += max(0, rem+1 - K)
print(ans) | N,K = list(map(int,input().split()))
if K == 0:
print((N*N))
exit()
ans = 0
for b in range(K+1,N+1):
d,m = divmod(N,b)
ans += d*(b-K) + max(0,m+1-K)
print(ans) | p03420 |
def main():
N, K = list(map(int, input().split()))
cnt = 0
for b in range(1,N+1):
cnt += (N // b) * max(0, b - K)
cnt += max(0, (N % b) + 1 - K)
if K == 0:
cnt -= N
print(cnt)
if __name__ == "__main__":
main() | def num_divisors_cnt(n):
table = [0] * (n + 1)
for i in range(1, n+1):
for j in range(i, n + 1, i):
table[j] += 1
return table
def main():
N, K = list(map(int, input().split()))
ans = 0
for i in range(K+1,N+1):
cnt = i - K
cnt *=... | p03420 |
n, k = list(map(int, input().split()))
ans = 0
if k == 0:
print((n * n))
exit()
for i in range(k + 1, n + 1):
# 周期i
# 0 1 2 3 ... i - 1, 0,
# 1周期にi - kこk以上
# 1始まりなのがめんどい
# 最初1周期だけさせる
m = n
m -= i - 1
ans += i - k
full = m // i * (i - k)
amari = m % ... | n, k = list(map(int, input().split()))
print((sum([n // i * (i - k) + max(0, n % i - k + 1)
for i in range(k + 1, n + 1)]) - (k == 0) * n))
| p03420 |
n,k = list(map(int,input().split()))
print((sum([(i-k)*(n//i)+max(0,n%i-max(0,k-1)) for i in range(k+1,n+1)]))) | n,k = list(map(int,input().split()))
print((n**2 if not k else sum([(i-k)*(n//i)+max(0,n%i-k+1) for i in range(k+1,n+1)]))) | p03420 |
N,K = list(map(int,input().split()))
ans = 0
for b in range(1,N+1) :
p = N//b
r = N % b
ans += max(0, b-K)*p + max(0, r-K+1)
if K == 0 :
ans -= 1
print(ans)
| N,K = list(map(int,input().split()))
ans = 0
for b in range(1,N+1) :
p = N//b
r = N % b
ans += max(0, b-K)*p + max(0, r-K+1)
if K == 0 :
ans -= N
print(ans)
| p03420 |
N,K=list(map(int,input().split()))
b = K + 1
s = 0
while b <= N:
c = N % b
s += (N//b)*(b-K) + max(0,c-K+1)
b += 1
print((s if K != 0 else N*N))
| N,K=list(map(int,input().split()))
b,s=K+1,0
while b <= N:
c=N%b
s+=(N//b)*(b-K)+max(0,c-K+1)
b+=1
print((s if K!=0 else N*N)) | p03420 |
N,K=list(map(int,input().split()))
b,s=K+1,0
while b <= N:
c=N%b
s+=(N//b)*(b-K)+max(0,c-K+1)
b+=1
print((s if K!=0 else N*N)) | N,K=list(map(int,input().split()))
s=0
for b in range(K+1,N+1):s+=(N//b)*(b-K)+max(0,N%b-K+1)
print((s if K!=0 else N*N)) | p03420 |
N,K=list(map(int,input().split()))
if K==0:
print((N**2))
exit(0)
ans=0
for i in range(K+1,N+1):
cur=0
base=i-(K-1)-1
cur+=(N//i)*base
rest=N%i
cur+=max(rest-(K-1),0)
ans+=cur
print(ans) | N,K=list(map(int,input().split()))
if K==0:
print((N**2))
exit(0)
ans=0
for i in range(K+1,N+1):
base=i-(K-1)-1
ans+=(N//i)*base
rest=N%i
ans+=max(rest-(K-1),0)
print(ans) | p03420 |
import itertools
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N,MOD = list(map(int,input().split()))
if N == 1:
print((1))
exit()
graph = [set() for _ in range(N)]
for row in sys.stdin.readlines():
x,y = list(map(int,row.split()))
graph[x-1].add(y-1)
graph[y-1].... | import itertools
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N,MOD = list(map(int,input().split()))
if N == 1:
print((1))
exit()
graph = [set() for _ in range(N)]
for row in sys.stdin.readlines():
x,y = list(map(int,row.split()))
graph[x-1].add(y-1)
graph[y-1].... | p03181 |
import sys
from collections import deque
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
G = [[] for i in range(N)]
for i in range(N-1):
x, y = list(map(int, readline().split()))
G[x-1].append((y-1, 2*i))
G[y-1].append((x-1, 2*i+1))
G0 = [No... | import sys
from collections import deque
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
G = [[] for i in range(N)]
for i in range(N-1):
x, y = list(map(int, readline().split()))
G[x-1].append((y-1, 2*i))
G[y-1].append((x-1, 2*i+1))
G0 = [None]*N
V = [(0, -1)]
used =... | p03181 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N, MOD = list(map(int, input().split()))
#計算量 log(m)くらい
def modinv(a, m): #mod. m でのaの逆元 a^{-1}を計算する
b = m
u = 1
v = 0
while b:
t = a//b
a -= t * b
a, b = b, a
u -= t * v
u, v... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N, MOD = list(map(int, input().split()))
#計算量 log(m)くらい
def modinv(a, m): #mod. m でのaの逆元 a^{-1}を計算する
b = m
u = 1
v = 0
while b:
t = a//b
a -= t * b
a, b = b, a
u -= t * v
u, v... | p03181 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N, MOD = list(map(int, input().split()))
G = [[] for _ in range(N + 1)]
for _ in range(N - 1):
x, y = list(map(int, input().split()))
G[x].append(y)
G[y].append(x)
G[0].append(1)
G[1].append(0)
DP1 = [-1] * (N + 1)
DP... | import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10 ** 7)
N, MOD = list(map(int, input().split()))
G = [[] for _ in range(N + 1)]
for _ in range(N - 1):
x, y = list(map(int, input().split()))
G[x].append(y)
G[y].append(x)
G[0].append(1)
G[1].append(0)
DP1 = [0] * (N + 1)
... | p03181 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
def solve():
N, MOD = list(map(int, input().split()))
adjL = [[] for _ in range(N)]
for _ in range(N-1):
x, y = list(map(int, input().split()))
x, y = x-1, y-1
adjL[x].append(y)
adjL[y].append(x)
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
N, MOD = list(map(int, input().split()))
adjL = [[] for _ in range(N)]
for _ in range(N-1):
x, y = list(map(int, input().split()))
x, y = x-1, y-1
adjL[x].append(y)
adjL[y].append(x)
def ReRooting(adjL):
def merge(val1... | p03181 |
import sys
sys.setrecursionlimit(1000000)
def dfs1(u, pu):
dp[u] = 1
for v in tree[u]:
if v != pu:
dfs1(v, u)
dp[u] *= (dp[v] + 1)
dp[u] %= MOD
def dfs2(u, pu, pval):
resp[u] = (dp[u] * pval) % MOD
chlds = [v for v in tree[u] if v != pu]
... |
n, MOD = list(map(int, input().split()))
tree = [[] for _ in range(n)]
for _ in range(n - 1):
u, v = [int(u) - 1 for u in input().split()]
tree[u].append(v)
tree[v].append(u)
cola = [(0, -1)]
qind = 0
while qind < len(cola):
u, pu = cola[qind]
qind += 1
for v in tree[u]:
... | p03181 |
from functools import reduce
from itertools import accumulate,chain
def rerooting(N, adj, merge, identity, finalize):
"""
merge: (T,T) -> T, (T, merge)はモノイド
identity: 単位元
finalize: T -> T
以下の形で書けるdpは対応可能
dp[u,v] = finalize(merge(dp[v,k] for k in adj[v] if k != u))
ただし(u,v)は辺
... |
from functools import reduce
from itertools import accumulate,chain
def rerooting(N, adj, merge, identity, finalize):
"""
merge: (T,T) -> T, (T, merge)はモノイド
identity: 単位元
finalize: T -> T
以下の形で書けるdpは対応可能
dp[u,v] = finalize(merge(dp[v,k] for k in adj[v] if k != u))
ただし(u,v)は辺
... | p03181 |
class Graph:
def __init__(self, n_vertices, edges, directed=True, weighted=False):
self.n_vertices = n_vertices
self.edges = edges
self.directed = directed
self.weighted = weighted
@property
def adj(self):
try:
return self._adj
except A... | class Graph:
def __init__(self, n_vertices, edges, directed=True):
self.n_vertices = n_vertices
self.edges = edges
self.directed = directed
@property
def adj(self):
try:
return self._adj
except AttributeError:
adj = [[] for _ in r... | p03181 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.