input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# -*- coding: utf-8 -*-
# AtCoder Beginner Contest
# Problem C
if __name__ == '__main__':
n = int(eval(input()))
dp = [0] + [100001 for _ in range(n + 1)]
# See:
# https://www.youtube.com/watch?v=I-8BnRkq6Ow
for i in range(1, n + 1):
power = 1
while power <= i:
dp[i] = min(dp[i], dp[i - power] + 1)
power *= 6
power = 1
while power <= i:
dp[i] = min(dp[i], dp[i - power] + 1)
power *= 9
print((dp[n]))
| # -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
dp = [float('inf') for _ in range(n + 100)]
dp[0] = 0
for i in range(1, n + 1):
dp[i] = min(dp[i - 1] + 1, dp[i])
six = 6
while six <= i:
dp[i] = min(dp[i - six] + 1, dp[i])
six *= 6
nine = 9
while nine <= i:
dp[i] = min(dp[i - nine] + 1, dp[i])
nine *= 9
print((dp[n]))
if __name__ == '__main__':
main()
| p03329 |
N=int(eval(input()))
dp=[float('inf') for i in range(100001)]
dp[0]=0
for i in range(1,N+1):
power=1
while(power<=i):
dp[i]=min(dp[i],dp[i-power]+1)
power*=6
power=1
while(power<=i):
dp[i]=min(dp[i],dp[i-power]+1)
power*=9
print((dp[N]))
| N=int(eval(input()))
dp=[float('inf') for i in range(N+1)]
dp[0]=0
for i in range(1,N+1):
power=1
while(power<=i):
dp[i]=min(dp[i],dp[i-power]+1)
power*=6
power=1
while(power<=i):
dp[i]=min(dp[i],dp[i-power]+1)
power*=9
print((dp[N]))
| p03329 |
n = int(eval(input()))
mn = 1e10
for i in range(n+1):
ans = 0
a, b = i, n-i
while a>=6:
a, mo = divmod(a, 6)
ans += mo
ans += a
while b>=9:
b, mo = divmod(b, 9)
ans += mo
ans += b
mn = min(mn, ans)
print(mn) | def rec(n, x):
d, m = divmod(n, x)
if d: return m + rec(d, x)
else: return m
ans = n = int(eval(input()))
for i in range(n+1):
ans = min(ans, rec(i, 6)+rec(n-i, 9))
print(ans) | p03329 |
import sys
sys.setrecursionlimit(10 ** 9)
from functools import lru_cache
def input(): return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
yen = [6 ** i for i in range(1, 7)]
yen += [9 ** i for i in range(1, 6)]
yen = [i for i in yen if i <= N]
yen.sort(reverse=True)
def MIN(a, b):
if a > b:
return b
else:
return a
@lru_cache(maxsize=None)
def dfs(x, n, m):
n += 1
for y in yen:
if n >= m:
return n
if y > x:
continue
if x - y < 6:
return n + x - y
m = MIN(dfs(x - y, n, m), m)
return m
print((dfs(N, 0, N)))
if __name__ == '__main__':
main()
| import sys
def input(): return sys.stdin.readline().rstrip()
def MIN(a, b):
if a > b:
return b
else:
return a
def main():
N = int(eval(input()))
yen6 = [6 ** i for i in range(1, 7) if 6 ** i <= N]
yen9 = [9 ** i for i in range(1, 6) if 9 ** i <= N]
if N < 6:
print(N)
exit()
dp = [N] * (N + 1)
for i in range(6):
dp[i] = i
for i in range(1, N + 1):
for j in yen6:
if i - j < 0:
break
dp[i] = MIN(dp[i], dp[i - j] + 1)
for j in yen9:
if i - j < 0:
break
dp[i] = MIN(dp[i], dp[i - j] + 1)
print((dp[N]))
if __name__ == '__main__':
main()
| p03329 |
import sys
from math import log, floor
n = int(sys.stdin.readline().rstrip())
def main():
cand = set()
for i in range(floor(log(n, 6)) + 1):
if 6 ** i <= n:
cand.add(6 ** i)
if 9 ** i <= n:
cand.add(9 ** i)
cand = sorted(cand)
res = set([0])
cnt = 0
while True:
nex = set()
for val in res:
for c in cand:
if val + c <= n:
nex.add(val + c)
else:
break
cnt += 1
if n in nex:
return cnt
res = nex
if __name__ == '__main__':
ans = main()
print(ans) | import sys
n = int(sys.stdin.readline().rstrip())
def main():
bit6 = [0] * 8
bit9 = [0] * 7
b = n
for i in range(5, -1, -1):
q, r = divmod(b, 9 ** i)
bit9[i] = q
b = r
res = sum(bit6) + sum(bit9)
for _ in range(n):
i = 0
while True:
bit6[i] += 1
if bit6[i] == 6:
bit6[i] = 0
i += 1
else:
break
i = 0
while True:
bit9[i] -= 1
if bit9[i] == -1:
bit9[i] = 8
i += 1
else:
break
res = min(res, sum(bit6) + sum(bit9))
return res
if __name__ == '__main__':
ans = main()
print(ans) | p03329 |
import sys
def count(n, b):
res = 0
while n:
n, r = divmod(n, b)
res += r
return res
n = int(sys.stdin.readline().rstrip())
def main():
res = float('inf')
for i in range(n + 1):
res = min(res, count(i, 6) + count(n - i, 9))
print(res)
if __name__ == '__main__':
main() | import sys
def count(n, b):
res = 0
while n:
res += n % b
n //= b
return res
n = int(sys.stdin.readline().rstrip())
def main():
res = float('inf')
for i in range(n + 1):
res = min(res, count(i, 6) + count(n - i, 9))
print(res)
if __name__ == '__main__':
main() | p03329 |
#DP 動的計画法
N = int(eval(input()))
INF = 10 ** 9
dp = [INF] * (N+1) #初期化配列
dp[0] = 0
for n in range(1, N+1):
power = 1
while power <= N:
dp[n] = min(dp[n], dp[n-power]+1)
power *= 6
power = 1
while power <= N:
dp[n] = min(dp[n], dp[n-power]+1)
power *= 9
#print (dp)
print((dp[N])) | N = int(eval(input()))
INF = 10 ** 9
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(1, N + 1):
dp[i] = dp[i - 1] + 1
tmp = 6
while i - tmp >= 0:
dp[i] = min(dp[i], dp[i - tmp] + 1)
tmp *= 6
tmp = 9
while i - tmp >= 0:
dp[i] = min(dp[i], dp[i - tmp] + 1)
tmp *= 9
# print (dp)
print((dp[N])) | p03329 |
# coding:utf-8
n = int(input().rstrip())
dic = [None for i in range(n + 1)]
def get_ans(amount:int):
if dic[amount] is not None:
return dic[amount]
if amount <= 0:
return 0
ans = amount
for i in reversed(list(range(6))):
num = pow(9, i)
if num > amount:
continue
ret = get_ans(amount - num) + 1
ans = min(ans, ret)
for i in reversed(list(range(7))):
num = pow(6, i)
if num > amount:
continue
ret = get_ans(amount - num) + 1
ans = min(ans, ret)
dic[amount] = ans
return ans
print((get_ans(n))) | # coding: utf-8
def get_pow(target: int, base: int):
ans = 0
current = base
for i in range(1, target + 1):
if current > target:
break
ans = i
current *= base
return ans
dic = {}
def get_ans(remain: int):
if remain in dic:
return dic[remain]
if remain < 6:
return max(0, remain)
ans = remain
pos9 = get_pow(remain, 9)
for i in reversed(list(range(1, pos9 + 1))):
ret = get_ans(remain - pow(9, i)) + 1
ans = min(ans, ret)
pow6 = get_pow(remain, 6)
for i in reversed(list(range(1, pow6 + 1))):
ret = get_ans(remain - pow(6, i)) + 1
ans = min(ans, ret)
dic[remain] = ans
return ans
n = int(input().rstrip())
print((get_ans(n)))
| p03329 |
n = int(eval(input()))
ark = float("INF")
for l in range(2): # 59049
abc = (n - (59049*l))
if abc < 0:
break
for k in range(3): # 46656
abc = (n - (46656 * k+59049*l))
if abc < 0:
break
for j in range(6): # 7776
abc = (n - (776 * j + 46656 * k+59049*l))
if abc < 0:
break
for h in range(4): # 1296,6
abc = (n - (1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for g in range(6): # 729,9
abc = (n - (729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for f in range(4):#216,5(4)
abc = (n - (216 * f+ 729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for e in range(4): # 81
abc = (n - (81 * e + 216 * f + 729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for d in range(5): # 36
abc = (n - (36 * d + 81 * e + 216 * f + 729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for c in range(4): # 9
abc = (n - (9 * c + 36 * d + 81 * e + 216 * f + 729 * g + 1296 * h + 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for b in range(3): # 6
abc = (n - (6 * b + 9 * c + 36 * d + 81 * e + 216 * f + 729 * g + 1296 * h + 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for a in range(6): # 1
abc = (n - (1*a+6*b+9*c+36*d+81*e+216*f+729*g+1296*h+7776*j+46656*k+59049*l))
if abc < 0:
break
if abc % 6561 == 0 and abc >= 0:
i = abc//6561
if ark > a+b+c+d+e+f+g+h+i+j+k+l:
ark = a+b+c+d+e+f+g+h+i+j+k+l
print(ark) |
n = int(eval(input()))
ark = float("INF")
if n < 50000:
for l in range(2): # 59049
abc = (n - (59049*l))
if abc < 0:
break
for k in range(3): # 46656
abc = (n - (46656 * k+59049*l))
if abc < 0:
break
for j in range(6): # 7776
abc = (n - (776 * j + 46656 * k+59049*l))
if abc < 0:
break
for h in range(4): # 1296,6
abc = (n - (1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for g in range(6): # 729,9
abc = (n - (729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for f in range(4):#216,5(4)
abc = (n - (216 * f+ 729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for e in range(4): # 81
abc = (n - (81 * e + 216 * f + 729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for d in range(5): # 36
abc = (n - (36 * d + 81 * e + 216 * f + 729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for c in range(4): # 9
abc = (n - (9 * c + 36 * d + 81 * e + 216 * f + 729 * g + 1296 * h + 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for b in range(3): # 6
abc = (n - (6 * b + 9 * c + 36 * d + 81 * e + 216 * f + 729 * g + 1296 * h + 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for a in range(6): # 1
abc = (n - (1*a+6*b+9*c+36*d+81*e+216*f+729*g+1296*h+7776*j+46656*k+59049*l))
if abc < 0:
break
if abc % 6561 == 0 and abc >= 0:
i = abc//6561
if ark > a+b+c+d+e+f+g+h+i+j+k+l:
ark = a+b+c+d+e+f+g+h+i+j+k+l
else:
for l in range(2): # 59049
abc = (n - (59049*l))
if abc < 0:
break
for k in range(3): # 46656
abc = (n - (46656 * k+59049*l))
if abc < 0:
break
for j in range(6): # 7776
abc = (n - (776 * j + 46656 * k+59049*l))
if abc < 0:
break
for h in range(3): # 1296,6
abc = (n - (1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for g in range(4): # 729,9
abc = (n - (729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for f in range(3):#216,5(4)
abc = (n - (216 * f+ 729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for e in range(4): # 81
abc = (n - (81 * e + 216 * f + 729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for d in range(5): # 36
abc = (n - (36 * d + 81 * e + 216 * f + 729 * g + 1296 * h+ 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for c in range(4): # 9
abc = (n - (9 * c + 36 * d + 81 * e + 216 * f + 729 * g + 1296 * h + 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for b in range(3): # 6
abc = (n - (6 * b + 9 * c + 36 * d + 81 * e + 216 * f + 729 * g + 1296 * h + 7776 * j + 46656 * k+59049*l))
if abc < 0:
break
for a in range(6): # 1
abc = (n - (1*a+6*b+9*c+36*d+81*e+216*f+729*g+1296*h+7776*j+46656*k+59049*l))
if abc < 0:
break
if abc % 6561 == 0 and abc >= 0:
i = abc//6561
if ark > a+b+c+d+e+f+g+h+i+j+k+l:
ark = a+b+c+d+e+f+g+h+i+j+k+l
print(ark) | p03329 |
N = int(eval(input()))
INF = float('inf')
dp = [INF] * (N+10)
dp[0] = 0
coin6 = [6**n for n in range(1,10) if 6**n <= N]
coin9 = [9**n for n in range(1,10) if 9**n <= N]
for i in range(N):
dp[i+1] = min(dp[i+1], dp[i]+1)
for j in coin6:
if j+i <= N:
dp[i+j]=min(dp[i+j],dp[i]+1)
for j in coin9:
if j+i <= N:
dp[i+j]=min(dp[i+j],dp[i]+1)
print((dp[N])) | N = int(eval(input()))
INF = float('inf')
dp = [INF] * (N+10)
dp[0] = 0
coin6 = [6**n for n in range(1,10) if 6**n <= N]
coin9 = [9**n for n in range(1,10) if 9**n <= N]
for i in range(N+1):
dp[i] = min(dp[i], dp[i-1]+1)
for j in coin6:
if i-j >= 0:
dp[i]=min(dp[i],dp[i-j]+1)
for j in coin9:
if i+j >= 0:
dp[i]=min(dp[i],dp[i-j]+1)
print((dp[N])) | p03329 |
n = int(eval(input()))
dp = [i for i in range(n+1)] # dp table 最初は全て1円で払う
for j in range(1, n+1):
power = 1
while power <= j:
dp[j] = min(dp[j], dp[j - power] + 1)
power *= 6
power = 1
while power <= j:
dp[j] = min(dp[j], dp[j - power] + 1)
power *= 9
print((dp[n]))
| n = int(eval(input()))
dp = [i for i in range(n + 1)]
for i in range(1, n+1):
pow = 6
while i - pow > -1:
dp[i] = min(dp[i], dp[i - pow] + 1)
pow *= 6
pow = 9
while i - pow > -1:
dp[i] = min(dp[i], dp[i - pow] + 1)
pow *= 9
# print(dp)
print((dp[n])) | p03329 |
n = int(eval(input()))
dp = [float("inf")]*(n+1)
dp[0] = 0
for i in range(n):
j = 0
while i+6**j <= n:
dp[i+6**j] = min(dp[i+6**j],dp[i]+1)
j += 1
k = 0
while i+9**k <= n:
dp[i+9**k] = min(dp[i+9**k],dp[i]+1)
k += 1
print((dp[n])) | n = int(eval(input()))
dp = [10**9+7]*(n+1)
dp[0] = 0
for i in range(1,n+1):
dp[i] = dp[i-1] + 1
j = 6
while i-j >= 0:
dp[i] = min(dp[i], dp[i-j]+1)
j *= 6
k = 9
while i-k >= 0:
dp[i] = min(dp[i], dp[i-k]+1)
k *= 9
print((dp[n])) | p03329 |
n = int(eval(input()))
dp = [float('inf')] * (n + 1)
dp[0] = 0
for i in range(n):
dp[i + 1] = min(dp[i + 1], dp[i] + 1)
for j in range(n):
if i + 6 ** (j + 1) <= n:
dp[i + 6 ** (j + 1)] = min(dp[i + 6 ** (j + 1)], dp[i] + 1)
else:
break
for k in range(n):
if i + 9 ** (k + 1) <= n:
dp[i + 9 ** (k + 1)] = min(dp[i + 9 ** (k + 1)], dp[i] + 1)
else:
break
print((dp[n])) | n = int(eval(input()))
dp = [float('inf')] * (n + 1)
dp[0] = 0
for i in range(n):
dp[i + 1] = min(dp[i + 1], dp[i] + 1)
for j in range(n):
if i + 6 ** (j + 1) <= n:
dp[i + 6 ** (j + 1)] = min(dp[i + 6 ** (j + 1)], dp[i] + 1)
else:
break
for k in range(n):
if i + 9 ** (k + 1) <= n:
dp[i + 9 ** (k + 1)] = min(dp[i + 9 ** (k + 1)], dp[i] + 1)
else:
break
print((dp[n])) | p03329 |
N=int(eval(input()))
M=[0]*(N+1)
M[1]=1
for i in range(2,N+1):
L=[M[i-1]+1]
j=0
while i-6**j>=0:
L.append(M[i-6**j]+1)
j+=1
j=0
while i-9**j>=0:
L.append(M[i-9**j]+1)
j+=1
M[i]=min(L)
#print(M)
print((M[N])) | N = int(eval(input()))
pattern = [1, 6, 36, 216, 1296, 7776, 46656, 9, 81, 729, 6561, 59049]
INF = 10**6
dp = [INF] * (N+1)
dp[0] = 0
for i in range(N+1):
for p in pattern:
if i + p <= N:
dp[i+p] = min(dp[i+p], dp[i]+1)
print((dp[N])) | p03329 |
N = int(eval(input()))
A = []
for i in range(1, N+1):
if 6**i > N:
break
else:
A.append(6**i)
if 9**i <= N:
A.append(9**i)
A.sort(reverse=True)
money = [i for i in range(N+1)]
for i in A:
for j in range(i,N+1):
money[j] = min(money[j], money[j-i]+1)
print((money[N]))
| n = int(eval(input()))
ans = float('INF')
hand = []
tmp = 1
while tmp * 6 <= n:
tmp *= 6
hand.append(tmp)
tmp = 1
while tmp * 9 <= n:
tmp *= 9
hand.append(tmp)
hand.sort()
hand = hand[::-1]
dp = [i for i in range(n+1)]
for v in hand:
for i in range(n+1-v):
if dp[i] + 1 < dp[i+v]:
dp[i+v] = dp[i] + 1
print((dp[n]))
| p03329 |
def main():
N = int(eval(input()))
withdraws = []
for i in range(N):
if N < 9**i:
break
withdraws.append(9**i)
for i in range(1, N):
if N < 6**i:
break
withdraws.append(6**i)
withdraws.sort(reverse=True)
W = len(withdraws)
dp = [[10**9 for i in range(N + 1)] for j in range(W + 1)]
dp[0][0] = 0
for i in range(1, W+1):
for n in range(N + 1):
if n - withdraws[i-1] >= 0:
dp[i][n] = min(dp[i-1][n], dp[i][n],
dp[i][n - withdraws[i-1]] + 1)
else:
dp[i][n] = min(dp[i-1][n], dp[i][n])
print((dp[W][N]))
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
withdraws = []
for i in range(N):
if N < 9**i:
break
withdraws.append(9**i)
for i in range(1, N):
if N < 6**i:
break
withdraws.append(6**i)
withdraws.sort(reverse=True)
W = len(withdraws)
dp = [[10**9 for i in range(N + 1)] for j in range(W + 1)]
dp[0][0] = 0
for i in range(1, W+1):
for n in range(N + 1):
if n - withdraws[i-1] >= 0:
dp[i][n] = min(dp[i-1][n], dp[i][n - withdraws[i-1]] + 1)
else:
dp[i][n] = dp[i-1][n]
print((dp[W][N]))
if __name__ == '__main__':
main()
| p03329 |
import sys
from collections import deque
# q = deque(); q.append(x); q.appendleft(x); q.pop() -> x; q.popleft() -> x
from collections import defaultdict
# d = defaultdict(lambda: []); d[key] -> []
import heapq
# hq = []; heapq.heappush(hq, x); heapq.heappop(hq) -> x; heapq.heappushpop(hq, x) -> x
import bisect
# i = bisect.bisect_left([1,2,3,4], 1.5); i = bisect.bisect_right([4,3,2,1], 1.5)
#import numpy as np
#from scipy.misc import comb
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
# BFS方法
def main():
N = i2n()
coins = [1]
d = 6
while d <= N:
coins.append(d)
d *= 6
d = 9
while d <= N:
coins.append(d)
d *= 9
q = deque()
q.append((0, 0))
s = set((0,))
while len(q) > 0:
i, n = q.popleft()
for j in coins:
k = i + j
if k == N:
print((n+1))
return
if k > N:
continue
if k in s:
continue
q.append((k, n+1))
s.add(k)
print((-1))
main()
| import sys
from collections import deque
# q = deque(); q.append(x); q.appendleft(x); q.pop() -> x; q.popleft() -> x
from collections import defaultdict
# d = defaultdict(lambda: []); d[key] -> []
import heapq
# hq = []; heapq.heappush(hq, x); heapq.heappop(hq) -> x; heapq.heappushpop(hq, x) -> x
import bisect
# i = bisect.bisect_left([1,2,3,4], 1.5); i = bisect.bisect_right([4,3,2,1], 1.5)
#import numpy as np
#from scipy.misc import comb
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
# BFS方法
def main():
N = i2n()
coins = [1]
d = 6
while d <= N:
coins.append(d)
d *= 6
d = 9
while d <= N:
coins.append(d)
d *= 9
q = deque()
q.append((0, 0))
s = set((0,))
while q:
i, n = q.popleft()
for j in coins:
k = i + j
if k == N:
print((n+1))
return
if k > N:
continue
if k in s:
continue
q.append((k, n+1))
s.add(k)
print((-1))
main()
| p03329 |
N = int(eval(input()))
dp = [float('inf')]*(N+1)
dp[0] = 0
for i in range(N+1):
if i+1 <= N:
dp[i+1] = min(dp[i+1],dp[i]+1)
for j in range(1,N+1):
if i + 6**j > N:
break
dp[i+6**j] = min(dp[i+6**j],dp[i]+1)
for k in range(1,N+1):
if i + 9**k > N:
break
dp[i+9**k] = min(dp[i+9**k],dp[i]+1)
print((dp[N])) | N = int(eval(input()))
dp = [float('inf')]*(N+1)
dp[0] = 0
for i in range(N+1):
if i >= 1:
dp[i] = min(dp[i-1]+1,dp[i])
for j in range(1,N+1):
if i < 6**j:
break
dp[i] = min(dp[i-6**j]+1,dp[i])
for k in range(1,N+1):
if i < 9**k:
break
dp[i] = min(dp[i-9**k]+1,dp[i])
print((dp[N])) | p03329 |
from itertools import count
n = int(eval(input()))
dp = [0]*(n+1)
def it(n):
yield 1
m = 6
while m <= n:
yield m
m *= 6
m = 9
while m <= n:
yield m
m *= 9
for i in range(1,n+1):
dp[i] = min(dp[i-t] for t in it(i))+1
print((dp[n]))
| def it(n,p):
while n > 0:
yield n%p
n //= p
cost = lambda *a: sum(it(*a))
n = int(eval(input()))
print((min(cost(x,6)+cost(n-x,9) for x in range(n+1)))) | p03329 |
def fx(n):
if n == 0:
return 0
if n == 1:
return 1
arr = []
cnt = 0
if n < 6:
b = fx(n-1)+1
arr.append(b)
while n-6**cnt >= 0:
cnt += 1
if cnt > 1:
x = n-(6**(cnt-1))
b = fx(x)+1
arr.append(b)
cnt = 0
while n-9**cnt >= 0:
cnt += 1
if cnt > 1:
x = n-(9**(cnt-1))
b = fx(x)+1
arr.append(b)
return min(arr)
N = int(eval(input()))
print((fx(N)))
| from functools import lru_cache
@lru_cache(maxsize=1000000)
def fx(n):
if n == 0:
return 0
if n == 1:
return 1
arr = []
cnt = 0
if n < 6:
b = fx(n-1)+1
arr.append(b)
while n-6**cnt >= 0:
cnt += 1
if cnt > 1:
x = n-(6**(cnt-1))
b = fx(x)+1
arr.append(b)
cnt = 0
while n-9**cnt >= 0:
cnt += 1
if cnt > 1:
x = n-(9**(cnt-1))
b = fx(x)+1
arr.append(b)
return min(arr)
N = int(eval(input()))
print((fx(N)))
| p03329 |
N = int(eval(input()))
t = list(range(N+1))
for i in range(2, N+1):
x = t[i-1] + 1
p6, p9 = 6, 9
while i-p6 >= 0:
x = min(x, t[i-p6] + 1)
p6 *= 6
while i-p9 >= 0:
x = min(x, t[i-p9] + 1)
p9 *= 9
t[i] = x
print((t[N]))
| N=int(eval(input()));t=[0]+[N]*N
for i in range(1,N+1):
x,a,b=t[i-1],6,9
while a<=i:x=min(x,t[i-a],t[i-b]if b<=i else N);a*=6;b*=9
t[i]=x+1
print((t[N])) | p03329 |
# 貰うDP
n = int(eval(input()))
a = [1]
i = 6
while i <= n:
a.append(i)
i *= 6
i = 9
while i <= n:
a.append(i)
i *= 9
t = [float("inf")] * (n + 1)
t[0] = 0
for i in range(1, n + 1):
k = float("inf")
for j in a:
if i - j >= 0 and k > t[i - j] + 1:
k = t[i - j] + 1
t[i] = k
print((t[n]))
| # 貰うDP
n = int(eval(input()))
a = [1]
i = 6
while i <= n:
a.append(i)
i *= 6
i = 9
while i <= n:
a.append(i)
i *= 9
t = [0] * (n + 1)
for i in range(1, n + 1):
k = float("inf")
for j in a:
if i - j >= 0 and k > t[i - j] + 1:
k = t[i - j] + 1
t[i] = k
print((t[n]))
| p03329 |
# 貰うDP
n = int(eval(input()))
a = [1]
i = 6
while i <= n:
a.append(i)
i *= 6
i = 9
while i <= n:
a.append(i)
i *= 9
t = [0] * (n + 1)
for i in range(1, n + 1):
k = float("inf")
for j in a:
if i - j >= 0 and k > t[i - j] + 1:
k = t[i - j] + 1
t[i] = k
print((t[n]))
| # 貰うDP
INF = float('inf')
n = int(eval(input()))
a = [1]
i = 6
while i <= n:
a.append(i)
i *= 6
i = 9
while i <= n:
a.append(i)
i *= 9
t = [0] * (n + 1)
for i in range(1, n + 1):
k = INF
for j in a:
if i - j >= 0 and k > t[i - j] + 1:
k = t[i - j] + 1
t[i] = k
print((t[n]))
| p03329 |
# DP(配るDP)
INF = float('inf')
N = int(eval(input()))
c = [1]
t = 6
while t <= N:
c.append(t)
t *= 6
t = 9
while t <= N:
c.append(t)
t *= 9
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
for j in c:
if i + j <= N:
dp[i + j] = min(dp[i + j], dp[i] + 1)
if i + j == N:
break
print((dp[N]))
| # DP(配るDP)
INF = float('inf')
N = int(eval(input()))
c = [1]
t = 6
while t <= N:
c.append(t)
t *= 6
t = 9
while t <= N:
c.append(t)
t *= 9
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
for j in c:
t = i + j
if t <= N and dp[t] > dp[i] + 1:
dp[t] = dp[i] + 1
if t == N:
break
print((dp[N]))
| p03329 |
# DP(配るDP)
INF = float('inf')
N = int(eval(input()))
c = [1]
t = 6
while t <= N:
c.append(t)
t *= 6
t = 9
while t <= N:
c.append(t)
t *= 9
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
for j in c:
t = i + j
if t <= N and dp[t] > dp[i] + 1:
dp[t] = dp[i] + 1
if t == N:
break
print((dp[N]))
| # DP(配るDP)
INF = float('inf')
N = int(eval(input()))
c = [1]
t = 6
while t <= N:
c.append(t)
t *= 6
t = 9
while t <= N:
c.append(t)
t *= 9
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
t0 = dp[i]
for j in c:
t1 = i + j
if t1 <= N and dp[t1] > t0 + 1:
dp[t1] = t0 + 1
if t1 == N:
break
print((dp[N]))
| p03329 |
# DP(配るDP)
INF = float('inf')
N = int(eval(input()))
c = [1]
t = 6
while t <= N:
c.append(t)
t *= 6
t = 9
while t <= N:
c.append(t)
t *= 9
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
t0 = dp[i] + 1
for j in c:
t1 = i + j
if t1 <= N and dp[t1] > t0:
dp[t1] = t0
if t1 == N:
break
print((dp[N]))
| # DP(配るDP)
INF = float('inf')
N = int(eval(input()))
c = [1]
t = 6
while t <= N:
c.append(t)
t *= 6
t = 9
while t <= N:
c.append(t)
t *= 9
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
t0 = dp[i] + 1
for j in c:
t1 = i + j
if t1 <= N and dp[t1] > t0:
dp[t1] = t0
print((dp[N]))
| p03329 |
n=int(eval(input()))
dp=[100001 for i in range(n+1)]
dp[0]=0
for i in range(1,n+1):
p=1
while p<=i:
dp[i]=min(dp[i],dp[i-p]+1)
p*=6
q=1
while q<=i:
dp[i]=min(dp[i],dp[i-q]+1)
q*=9
print((dp[n])) | n=int(eval(input()))
ans=10**100
for t in range(n+1):
p=t
q=n-p
c=0
while p>0:
c+=p%6
p=p//6
while q>0:
c+=q%9
q=q//9
ans=min(ans,c)
print(ans)
| p03329 |
sixexp=[6**i for i in range(1,7)]
nineexp=[9**i for i in range(1,6)]
lis=[1]+sixexp+nineexp
n=int(eval(input()))
dp=[1000000 for i in range (n+1)]
dp[0]=0
for i in range(n):
for j in lis:
if i+j<=n:
dp[i+j]=min(dp[i+j],dp[i]+1)
print((dp[n])) | sixexp=[6**i for i in range(1,7)]
nineexp=[9**i for i in range(1,6)]
lis=[1]+sixexp+nineexp
n=int(eval(input()))
dp=[1000000 for i in range (n+1)]
dp[0]=0
for i in range(1,n+1):
for j in lis:
if i-j>=0:
dp[i]=min(dp[i],dp[i-j]+1)
print((dp[n])) | p03329 |
import bisect as bi
li6 = [6 ** i for i in range(7)]
li9 = [9 ** i for i in range(6)]
def s69(n):
if n < 6:
return n
else:
s6 = li6[bi.bisect(li6, n)-1]
s9 = li9[bi.bisect(li9, n)-1]
return min(n // s6 + s69(n % s6), 1 + s69(n-s9), n // s9 + s69(n % s9))
print((s69(int(eval(input()))))) | import bisect as bi
li6 = [6 ** i for i in range(7)]
li9 = [9 ** i for i in range(6)]
def s69(n):
if n < 6:
return n
else:
s6 = li6[bi.bisect(li6, n)-1]
s9 = li9[bi.bisect(li9, n)-1]
return min(n // s6 + s69(n % s6), 1 + s69(n-s9))
print((s69(int(eval(input()))))) | p03329 |
n = int(eval(input()))
max_n = 100000
dp = [10000 for i in range(max_n+1)]
dp[0] = 0
for i in range(n+1):
k = 1
while i + k <= n:
dp[i+k] = min(dp[i+k],dp[i]+1)
k *=6
k = 1
while i + k <= n:
dp[i+k] = min(dp[i+k],dp[i]+1)
k*=9
print((dp[n])) | from collections import deque
n = int(eval(input()))
max_n = 100000
dp = [10000 for i in range(max_n+1)]
dp[0] = 0
que = deque()
que.append(0)
while len(que) > 0:
v = que.popleft()
k = 1
while v + k <= n:
if dp[v+k] == 10000:
dp[v+k]=dp[v]+1
que.append(v+k)
k *= 6
k = 1
while v + k <= n:
if dp[v+k] == 10000:
dp[v+k]=dp[v]+1
que.append(v+k)
k *= 9
print((dp[n])) | p03329 |
n=int(eval(input()))
ls=set([1])
i=1
while 6**i<=100000:
ls.add(6**i)
i+=1
i=1
while 9**i<=100000:
ls.add(9**i)
i+=1
dp = [float("inf") for i in range(n+2)]
dp[0] = 0
ls=list(ls)
#円の総合計
for i in range(n+2):
#額面のコインの種類
for j in range(len(ls)):
if i+ls[j]<=n:
dp[i+ls[j]] = min(dp[i]+1, dp[i+ls[j]-1]+1,dp[i+ls[j]])
print((dp[n])) | n=int(eval(input()))
ls=[1]
for i in range(1,7):
ls.append(6**i)
ls.append(9**i)
dp = [float('inf') for i in range(n+2)]
dp[0] = 0
#円の総合計
for i in range(1,n+1):
for j in ls:
if i-j>=0:
dp[i] = min(dp[i-1]+1, dp[i-j]+1,dp[i])
else:
dp[i] = min(dp[i-1]+1,dp[i])
print((dp[n])) | p03329 |
N = int(eval(input()))
dp = [N] * (N+1)
dp[0] = 0
for i in range(1, N+1):
pow6 = []
pow9 = []
for j in range(i):
if 6**j > i:
break
pow6.append(6**j)
for k in range(i):
if 9**k > i:
break
pow9.append(9**k)
L = set(pow6 + pow9)
for l in L:
if i-l < 0:
break
dp[i] = min(dp[i], dp[i-l]+1)
print((dp[N])) | N = int(eval(input()))
INF = 10**9
dp = [INF]*(N+1)
dp[0] = 0
num6 = [6**i for i in range(1, 10)]
num9 = [9**i for i in range(1, 7)]
S = sorted([1] + num6 + num9)
for i in range(1, N+1):
tmp = INF
for j in S:
if j > i:
break
else:
dp[i] = min(tmp, dp[i-j]+1)
tmp = dp[i]
print((dp[N])) | p03329 |
N = int(eval(input()))
INF = 10**9
dp = [INF]*(N+1)
dp[0] = 0
num6 = [6**i for i in range(1, 10)]
num9 = [9**i for i in range(1, 7)]
S = sorted([1] + num6 + num9)
for i in range(1, N+1):
tmp = INF
for j in S:
if j > i:
break
else:
dp[i] = min(tmp, dp[i-j]+1)
tmp = dp[i]
print((dp[N])) | N = int(eval(input()))
INF = 10**9
dp = [INF]*(N+1)
dp[0] = 0
num6 = [6**i for i in range(1, 10)]
num9 = [9**i for i in range(1, 7)]
S = sorted([1] + num6 + num9)
for i in range(1, N+1):
for j in S:
if j > i:
break
else:
dp[i] = min(dp[i], dp[i-j]+1)
print((dp[N])) | p03329 |
N = int(eval(input()))
x = N
for i in range(N + 1):
count = 0
t = i
while t > 0:
count += int(t % 9)
t = int(t / 9)
t = N - i
while t > 0 :
count += int(t % 6)
t = int(t / 6)
if x > count:
x = count
print(x) | N = int(eval(input()))
ans = N
for i in range(N + 1):
count = 0
t = i
while t > 0:
count += int(t % 9)
t = int(t / 9)
t = N - i
while t > 0:
count += int(t % 6)
t = int(t / 6)
if count < ans:
ans = count
print(ans) | p03329 |
N = int(eval(input()))
def f(n):
if n<6:
return n
i,j = 0,0
a,b = n,n
while a >= 6:
i += 1
a //= 6
while b >= 9:
j += 1
b //= 9
return min(1+f(n-6**i),1+f(n-9**j))
print((f(N))) | N = int(eval(input()))
memo = {i:i for i in range(6)}
def f(n):
tmp = memo.get(n,None)
if tmp != None:
return tmp
i,j = 0,0
a,b = n,n
while a >= 6:
i += 1
a //= 6
while b >= 9:
j += 1
b //= 9
ret = min(1+f(n-6**i),1+f(n-9**j))
memo[n] = ret
return ret
print((f(N))) | p03329 |
N = int(eval(input()))
dp = [float('inf') for _ in range(N + 1)]
dp[N] = 0
for i in range(N, -1, -1) :
if i - 1 >= 0 :
dp[i - 1] = min(dp[i - 1], dp[i] + 1)
dis = 6
while i - dis >= 0 :
dp[i - dis] = min(dp[i - dis], dp[i] + 1)
dis *= 6
dis = 9
while i - dis >= 0 :
dp[i - dis] = min(dp[i - dis], dp[i] + 1)
dis *= 9
print((dp[0])) | N = int(eval(input()))
dp = [10**18] * (N + 1)
dp[0] = 0
for i in range(N):
prd = 6
while i + prd <= N:
dp[i + prd] = min(dp[i + prd], dp[i] + 1)
prd *= 6
prd = 9
while i + prd <= N:
dp[i + prd] = min(dp[i + prd], dp[i] + 1)
prd *= 9
ans = 10**18
for i, c in enumerate(dp):
ans = min(ans, N - i + c)
print(ans)
| p03329 |
N = int(eval(input()))
dp = [10**18] * (N + 1)
dp[0] = 0
for i in range(N):
prd = 6
while i + prd <= N:
dp[i + prd] = min(dp[i + prd], dp[i] + 1)
prd *= 6
prd = 9
while i + prd <= N:
dp[i + prd] = min(dp[i + prd], dp[i] + 1)
prd *= 9
ans = 10**18
for i, c in enumerate(dp):
ans = min(ans, N - i + c)
print(ans)
| N = int(eval(input()))
def digit(x, base):
if x == 0:
return 0
return digit(x // base, base) + x % base
def calc(six, nine):
return digit(six, 6) + digit(nine, 9)
ans = 10**18
for six in range(N + 1):
ans = min(ans, calc(six, N - six))
print(ans) | p03329 |
l=[100000 for i in range(100001)]
l[0]=0
dif=[1,6,9,36,81,216,729,1296,6561,7776,46656,59049]
for i in range(1,100001):
for j in dif:
if j>i:
break
l[i]=min(l[i],l[i-j]+1)
n=int(eval(input()))
print((l[n])) | dp=[100000 for i in range(100001)]
dp[0]=0
l=[1]
i=6
while i<=100000:
l.append(i)
i*=6
i=9
while i<=100000:
l.append(i)
i*=9
for i in range(1,100001):
for j in l:
if j<=i and dp[i-j]+1<dp[i]:
dp[i]=dp[i-j]+1
print((dp[int(eval(input()))]))
| p03329 |
def nsin(X,n):
if(int(X/n)):
return nsin(int(X/n),n)+str(X%n)
return str(X)
N = int(eval(input()))
score = N
for i in range(N+1):
score = min(score,sum(map(int,nsin(i,6)+nsin(N-i,9))))
print(score) | N = int(eval(input()))
score = N
for i in range(N+1):
count = 0
t = i
while(t):
count += t%6
t//=6
t = N-i
while(t):
count += t%9
t//=9
score = min(count,score)
print(score) | p03329 |
N = int(eval(input()))
dp = [10 ** 6] * (N + 1)
dp[0] = 0
for i in range(N+1):
p = 1
while p <= N:
dp[i] = min(dp[i], dp[i-p] + 1)
p *= 6
p = 1
while p <= N:
dp[i] = min(dp[i], dp[i-p] + 1)
p *= 9
print((dp[N])) | N = int(eval(input()))
dp = [10 ** 6] * (N + 1)
dp[0] = 0
for i in range(N+1):
p = 1
while p <= i:
dp[i] = min(dp[i], dp[i-p] + 1)
p *= 6
p = 1
while p <= i:
dp[i] = min(dp[i], dp[i-p] + 1)
p *= 9
print((dp[N])) | p03329 |
six=[6**i for i in range(1,7)][::-1]
nine=[9**i for i in range(1,6)][::-1]
N=int(eval(input()))
ans=[]
def find(n,a):
if n<6: ans.append(n+a)
for s in six:
if s<=n:
find(n-s,a+1)
break
for s in nine:
if s<=n:
find(n-s,a+1)
break
find(N,0)
print((min(ans))) | six=[6**i for i in range(1,7)][::-1]
nine=[9**i for i in range(1,6)][::-1]
N=int(eval(input()))
ans=[]
def find(n,a):
if n<6:
ans.append(n+a)
return
for s in six:
if s<=n:
find(n-s,a+1)
break
for s in nine:
if s<=n:
find(n-s,a+1)
break
find(N,0)
print((min(ans))) | p03329 |
N=int(eval(input()))
weights=[1]
pow6=6
while N>=pow6:
weights.append(pow6)
pow6*=6
pow9=9
while N>=pow9:
weights.append(pow9)
pow9*=9
dp=[1<<28]*(N+1)
dp[0]=0
for i in range(len(weights)):
for j in range(weights[i],N+1):
dp[j]=min(dp[j],dp[j-weights[i]]+1)
print((dp[N])) | N=int(eval(input()))
res=N
for i in range(N+1):
cc=0
tmp=i
while tmp>0:
cc+=tmp%6
tmp=tmp//6
tmp=N-i
while tmp>0:
cc+=tmp%9
tmp=tmp//9
res=min(res,cc)
print(res) | p03329 |
import sys
imput=sys.stdin.readline
n=int(eval(input()))
dp=[float('inf')]*(n+1)
dp[1]=1
i=0
while 9**i<=n:
dp[9**i]=1
i+=1
j=0
while 6**j<=n:
dp[6**j]=1
j+=1
#print(dp[1],dp[9],dp[36],dp[127])
for i in range(2,n+1):
for j in range(1,8):
if i-6**j>=1 and i-9**j>=1:
dp[i]=min(dp[i],min(dp[i-1],dp[i-6**j],dp[i-9**j])+1)
elif i-6**j>=1:
dp[i]=min(dp[i],min(dp[i-1],dp[i-6**j])+1)
else:
dp[i]=min(dp[i],dp[i-1]+1)
#print(dp)
#int(dp[1],dp[9],dp[36],dp[127])
print((dp[n])) | n=int(eval(input()))
dp=[float('inf')]*(n+1)
dp[1]=1
i=0
while 9**i<=n:
dp[9**i]=1
i+=1
j=0
while 6**j<=n:
dp[6**j]=1
j+=1
for i in range(2,n+1):
for j in range(1,8):
if i-6**j>=1 and i-9**j>=1:
dp[i]=min(dp[i],min(dp[i-1],dp[i-6**j],dp[i-9**j])+1)
elif i-6**j>=1:
dp[i]=min(dp[i],min(dp[i-1],dp[i-6**j])+1)
else:
dp[i]=min(dp[i],dp[i-1]+1)
print((dp[n]))
| p03329 |
N = int(eval(input()))
def drawal(x):
if(x <= 5):
return x
else:
def drawal9(y):
i = 0
while 9** (i+ 1)<= y:
i+= 1
return drawal(y- 9** i)+ 1
def drawal6(z):
i = 0
while 6** (i+ 1)<= z:
i+= 1
return drawal(z- 6** i)+ 1
return min(drawal9(x), drawal6(x))
print((drawal(N))) | N = int(eval(input()))
def drawal(x):
if(x <= 5):
return x
elif(6<= x and x < 9):
return x- 5
elif(9<= x and x < 15):
return x- 8
else:
def drawal9(y):
i = 0
while 9** (i+ 1)<= y:
i+= 1
return drawal(y- 9** i)+ 1
def drawal6(z):
i = 0
while 6** (i+ 1)<= z:
i+= 1
return drawal(z- 6** i)+ 1
return min(drawal9(x), drawal6(x))
print((drawal(N))) | p03329 |
N = int(eval(input()))
h = [1]
t = []
i = 1
while True:
t.append(6**i)
i += 1
if t[-1]>10000:
break
h.extend(t)
t = []
i = 1
while True:
t.append(9**i)
i += 1
if t[-1]>10000:
break
h.extend(t)
h.sort()
DP = []
DP.append((0, 0))
hlen = len(h)
for i in range(1,N+1):
m = 999999
p = 0
for j in range(hlen):
if i-h[j]<0:
break
else:
if m>DP[i-h[j]][0] + 1:
m = DP[i-h[j]][0] + 1
p = h[j] + DP[i-h[j]][0]
DP.append((m, p))
print((DP[N][0])) | N = int(eval(input()))
h = [1]
t = []
i = 1
while True:
t.append(6**i)
i += 1
if t[-1]>10000:
break
h.extend(t)
t = []
i = 1
while True:
t.append(9**i)
i += 1
if t[-1]>10000:
break
h.extend(t)
h.sort()
DP = []
DP.append(0)
hlen = len(h)
for i in range(1,N+1):
m = 999999
for j in range(hlen):
if i-h[j]<0:
break
else:
if m>DP[i-h[j]] + 1:
m = DP[i-h[j]] + 1
DP.append(m)
print((DP[N])) | p03329 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
ind = [1]
tmp = 6
while tmp <= N:
ind.append(tmp)
tmp *= 6
tmp = 9
while tmp <= N:
ind.append(tmp)
tmp *= 9
ind = sorted(ind)
INF = int(1e9)
dp = [INF] * (N+1)
dp[0] = 0
for i in range(1, N+1):
for t in ind:
if i - t >= 0:
dp[i] = min(dp[i], dp[i-t]+1)
else:
break
# print(dp[:20])
print((dp[N]))
if __name__ == "__main__":
main() | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
ans = N
for i in range(N+1):# 6^pで何円引き出すか
count = 0
tmp = i
while tmp > 0:
count += tmp % 6
tmp //= 6
tmp = N - i
while tmp > 0:
count += tmp % 9
tmp //= 9
ans = min(ans, count)
print(ans)
if __name__ == "__main__":
main() | p03329 |
n = int(eval(input()))
L = [1]
for i in range(1, 6):
L.append(pow(9, i))
for i in range(1, 7):
L.append(pow(6, i))
L = sorted(L)
dp = [float("inf") for _ in range(n + 1)]
dp[0] = 0
for i in range(1, n + 1):
for l in L:
if i - l >= 0:
dp[i] = min(dp[i], dp[i - l] + 1)
print((dp[n]))
| import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
List = [1]
for i in range(1, 7):
List.append(pow(6, i))
List.append(pow(9, i))
List.sort()
dp = [f_inf for _ in range(n + 1)]
dp[0] = 0
for i in range(1, n + 1):
for L in List:
if i - L >= 0:
dp[i] = min(dp[i], dp[i - L] + 1)
print((dp[n]))
if __name__ == '__main__':
resolve()
| p03329 |
n = int(eval(input()))
dp = [200000] * (n+10)
dp[0] = 0
# dp[1] = 1
for i in range(n):
dp[i+1] = min(dp[i+1], dp[i]+1)
six = 6
while i + six <= n:
dp[i+six] = min(dp[i+six], dp[i]+1)
six *= 6
nine = 9
while i + nine <= n:
dp[i+nine] = min(dp[i+nine], dp[i]+1)
nine *= 9
print((dp[n])) | n = int(eval(input()))
dp = [200000] * (n+10)
dp[0] = 0
for i in range(1,n+1):
dp[i] = min(dp[i-1]+1, dp[i])
six = 6
while i - six >= 0:
dp[i] = min(dp[i-six]+1, dp[i])
six *= 6
nine = 9
while i - nine >= 0:
dp[i] = min(dp[i-nine]+1, dp[i])
nine *= 9
print((dp[n])) | p03329 |
N = int(eval(input()))
INF = N
dp = [0, 1, 2, 3, 4, 5] + [INF for _ in range(N-5)]
for amount in range(6, N+1):
dp[amount] = amount
unit = 6
while unit <= amount:
dp[amount] = min(dp[amount], dp[amount-unit]+1)
unit *= 6
unit = 9
while unit <= amount:
dp[amount] = min(dp[amount], dp[amount-unit]+1)
unit *= 9
print((dp[N])) | N = int(eval(input()))
dp = list(range(N+1))
for amount in range(6, N+1):
unit = 6
while unit <= amount:
dp[amount] = min(dp[amount], dp[amount-unit]+1)
unit *= 6
unit = 9
while unit <= amount:
dp[amount] = min(dp[amount], dp[amount-unit]+1)
unit *= 9
print((dp[N])) | p03329 |
N = int(eval(input()))
dp = list(range(N+1))
for amount in range(6, N+1):
unit = 6
while unit <= amount:
dp[amount] = min(dp[amount], dp[amount-unit]+1)
unit *= 6
unit = 9
while unit <= amount:
dp[amount] = min(dp[amount], dp[amount-unit]+1)
unit *= 9
print((dp[N])) | N = int(eval(input()))
dp = list(range(N+1))
def calc(unit_base):
unit = unit_base
while unit <= amount:
dp[amount] = min(dp[amount], dp[amount-unit]+1)
unit *= unit_base
for amount in range(6, N+1):
calc(6)
calc(9)
print((dp[N])) | p03329 |
N=int(eval(input()))
ans=N
for i in range(N+1):
cnt=0
t=i
while t>0:
cnt+=t%6
t//=6
j=N-i
while j>0:
cnt+=j%9
j//=9
ans=min(ans,cnt)
print(ans)
| N=int(eval(input()))
dp=[0]*(100000+1)
a=1
b=6
c=9
for i in range(1,N+1):
if i>=b*6:
b*=6
if i>=c*9:
c*=9
if i<6:
dp[i]=i
elif i<9:
dp[i]=min(dp[i-a]+1,dp[i-b]+1)
else:
dp[i]=min([dp[i-a]+1,dp[i-b]+1,dp[i-c]+1])
print((dp[N]))
| p03329 |
N = int(eval(input()))
B6 = [6**i for i in range(1,7)]
B9 = [9**i for i in range(1,6)]
L = B6 + B9
L = sorted(list(set(L)))
dp = [int(i) for i in range(N+1)]
for i in L:
for j in range(1, N+1):
if j - i >= 0:
dp[j] = min(dp[j], dp[j-i] + 1)
print((dp[N])) | N = int(eval(input()))
dp = [int(i) for i in range(N+1)]
B6 = [6**i for i in range(1,7)]
B9 = [9**i for i in range(1,6)]
L = B6 + B9
L = sorted(list(set(L)))
for i in L:
for j in range(1, N+1):
if j - i >= 0:
dp[j] = min(dp[j], dp[j-i] + 1)
print((dp[N]))
| p03329 |
n=int(eval(input()))
l6=[]
l9=[]
num6=6
num9=9
while num6<=n:
l6.append(num6)
num6*=6
while num9<=n:
l9.append(num9)
num9*=9
count=[0,1,2,3,4,5,1,2,3,1,2,3]
for i in range(12,n+1):
min=100000
for j in l6:
if i-j<0:
pass
else:
if min>count[i-j]+1:
min=count[i-j]+1
for j in l9:
if i-j<0:
pass
else:
if min>count[i-j]+1:
min=count[i-j]+1
count.append(min)
print((count[n])) | n=int(eval(input()))
num6=6
num9=9
l=[]
while num6<=n:
l.append(num6)
num6*=6
while num9<=n:
l.append(num9)
num9*=9
count=[0,1,2,3,4,5,1,2,3,1,2,3]
for i in range(12,n+1):
min=100000
for j in l:
if i-j<0:
pass
else:
if min>count[i-j]+1:
min=count[i-j]+1
count.append(min)
print((count[n]))
| p03329 |
coin = [1,
6,6**2,6**3,6**4,6**5,6**6,
9,9**2,9**3,9**4,9**5]
n = int(eval(input()))
inf = 10**9
dp = [inf]*(n+1)
dp[0] = 0
for c in coin:
for yen in range(c, n+1):
dp[yen] = min(dp[yen], dp[yen-c] + 1)
print((dp[n]))
| n = int(eval(input()))
dp = list(i for i in range(n+1))
def f(yen, p):
c = p
while yen >= c:
dp[yen] = min(dp[yen], dp[yen-c] + 1)
c *= p
for yen in range(6, n+1):
f(yen, 6)
f(yen, 9)
print((dp[n]))
| p03329 |
n = int(eval(input()))
dp = list(i for i in range(n+1))
def f(yen, p):
c = p
while yen >= c:
dp[yen] = min(dp[yen], dp[yen-c] + 1)
c *= p
for yen in range(6, n+1):
f(yen, 6)
f(yen, 9)
print((dp[n]))
| def f(yen, coin, cnt=0):
while yen > 0: cnt += yen % coin; yen //= coin
return cnt
ans = n = int(eval(input()))
for yen6 in range(0, n+1):
ans = min(ans, f(n-yen6, 9, f(yen6, 6)))
print(ans)
| p03329 |
N = int(eval(input()))
list6 = [6**x for x in range(0,7) ]
list9 = [9**x for x in range(0,6) ]
def f(x):
if x < 6:
return x
else:
max6 = max(y for y in list6 if y <= x)
max9 = max(y for y in list9 if y <= x)
x6 = x - max6
x9 = x - max9
return min(f(x6)+ 1,f(x9)+ 1)
print((f(N))) | N = int(eval(input()))
list6 = [6**x for x in range(0,7) ]
list9 = [9**x for x in range(0,6) ]
result = {}
def f(x):
if x < 6:
return x
elif x in result:
return result[x]
else:
max6 = max(y for y in list6 if y <= x)
max9 = max(y for y in list9 if y <= x)
x6 = x - max6
x9 = x - max9
result[x] = min(f(x6)+ 1,f(x9)+ 1)
return result[x]
print((f(N))) | p03329 |
# -*- coding: utf-8 -*-
def count(val1, val2):
num = 1
while True:
if val1 < (val2 ** num):
res = 0
if num > 1:
res = val2 ** (num-1)
break
num += 1
return res
N = int(eval(input()))
ans = N
for i in range(0,N+1):
n = i
m = N - i
res = 0
while True:
num = count(n, 9)
if num == 0:
break
n -= num
res += 1
while True:
num = count(m, 6)
if num == 0:
break
m -= num
res += 1
res += n + m
ans = min(ans, res)
print(ans)
| # -*- coding: utf-8 -*-
def count(val1, val2):
num = 1
while True:
if val1 < (val2 ** num):
break
num += 1
cnt = 0
digit = num
while True:
if val1 >= val2 ** digit:
val1 -= val2 ** digit
cnt += 1
else:
digit -= 1
if digit== 0:
break
return cnt,val1
N = int(eval(input()))
ans = N
for i in range(0,N+1):
n = i
m = N - i
res = 0
cnt, nn = count(n, 9)
n = nn
res += cnt
cnt, mm = count(m, 6)
m = mm
res += cnt
res += n + m
ans = min(ans, res)
print(ans)
| p03329 |
# -*- coding: utf-8 -*-
def count(val1, val2):
num = 1
while True:
if val1 < (val2 ** num):
break
num += 1
cnt = 0
digit = num
while True:
if val1 >= val2 ** digit:
val1 -= val2 ** digit
cnt += 1
else:
digit -= 1
if digit== 0:
break
return cnt,val1
N = int(eval(input()))
ans = N
for i in range(0,N+1):
n = i
m = N - i
res = 0
cnt, nn = count(n, 9)
n = nn
res += cnt
cnt, mm = count(m, 6)
m = mm
res += cnt
res += n + m
ans = min(ans, res)
print(ans)
| # -*- coding: utf-8 -*-
N = int(eval(input()))
ans = N
for i in range(N+1):
n = i
m = N - i
res = 0
nine = 1
while nine*9 <= n:
nine *= 9
while nine != 1:
res += n // nine
n %= nine
nine /= 9
res += n
six = 1
while six*6 <= m:
six *= 6
while six != 1:
res += m // six
m %= six
six /= 6
res += m
ans = min(ans, int(res))
print(ans)
| p03329 |
# -*- coding: utf-8 -*-
def count(val1, val2):
digit = 1
while val1 >= (val2 ** digit):
digit += 1
res = 0
while digit!=0:
cnt = int(val1 // val2 ** digit)
val1 -= (val2 ** digit)*cnt
res += cnt
digit -= 1
return res,val1
N = int(eval(input()))
ans = N
for i in range(0,N+1):
n = i
m = N - i
res = 0
cnt, nn = count(n, 9)
n = nn
res += cnt
cnt, mm = count(m, 6)
m = mm
res += cnt
res += n + m
ans = min(ans, res)
print(ans)
| # -*- coding: utf-8 -*-
def count(val1, val2):
digit = 1
while digit*val2 <= val1:
digit *= val2
res = 0
while digit!=1:
cnt = int(val1 // digit)
val1 -= digit*cnt
res += cnt
digit /= val2
return res,val1
N = int(eval(input()))
ans = N
for i in range(0,N+1):
n = i
m = N - i
res = 0
cnt, nn = count(n, 9)
n = nn
res += cnt
cnt, mm = count(m, 6)
m = mm
res += cnt
res += n + m
ans = min(ans, int(res))
print(ans)
| p03329 |
# -*- coding: utf-8 -*-
def count(val1, val2):
digit = 1
while digit*val2 <= val1:
digit *= val2
res = 0
while digit!=1:
cnt = int(val1 // digit)
val1 -= digit*cnt
res += cnt
digit /= val2
return res,val1
N = int(eval(input()))
ans = N
for i in range(0,N+1):
n = i
m = N - i
res = 0
cnt, nn = count(n, 9)
n = nn
res += cnt
cnt, mm = count(m, 6)
m = mm
res += cnt
res += n + m
ans = min(ans, int(res))
print(ans)
| # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(100000) # RecursionError対策
def func(n):
if n==0:
return 0 # 終端条件
if memo[n] != -1:
return memo[n] # 探索済み
res = n
for i in range(1,n+1):
pow6 = 6 ** i
if pow6 > n:
break
res = min(res, func(n-pow6)+1)
for i in range(1,n+1):
pow9 = 9 ** i
if pow9 > n:
break
res = min(res, func(n-pow9)+1)
memo[n] = res
return res
N = int(eval(input()))
max_n = 110000
memo = [-1] * max_n
ans = func(N)
print(ans)
| p03329 |
N = int(eval(input()))
n6 = 1
n9 = 1
li = []
while 9**n9 <= N:
li.append(9**n9)
n9 += 1
while 6**n6 <= N:
li.append(6**n6)
n6 += 1
li.sort()
INF = 10**10
# 1円の場合はね
dp = [[i for i in range(N+1)] for i in range(len(li) + 1)]
dp = [i for i in range(N+1)]
for i,l in enumerate(li):
for j in range(N+1):
if j+l > N : continue
dp[j+l] = min(dp[j+l], dp[j]+1)
print((dp[N]))
| N = int(eval(input()))
array = []
cnt6 = 0
while 6**cnt6 <= N:
array.append(6**cnt6)
cnt6 += 1
cnt9 = 0
while 9**cnt9 <= N:
array.append(9**cnt9)
cnt9 += 1
a = sorted(list(set(array)))
# 最小
dp = [i for i in range(N+1)]
# print(a)
n = 6
for n in a:
for i in range(N+1):
if i+n <= N:
dp[i+n] = min(dp[i]+1, dp[i+n])
print((dp[N]))
| p03329 |
n = int(eval(input()))
v = [1,6,36,216,1296,7776,46656,9,81,729,6561,59049]
dp = [float("inf") for i in range(n+1)]
dp[0] = 0
for i in range(n):
for j in v:
if i + j <= n:
dp[i+j] = min(dp[i+j], dp[i]+1)
print(("{}".format(dp[n])))
| def ds(a, b):
return a if a<b else ds(a//b,b)+a%b
ans = float('inf')
n = int(eval(input()))
for i in range(n+1):
ans = min(ans,ds(i,6)+ds(n-i,9))
print(ans) | p03329 |
def ds(a, b):
return a if a<b else ds(a//b,b)+a%b
ans = float('inf')
n = int(eval(input()))
for i in range(n+1):
ans = min(ans,ds(i,6)+ds(n-i,9))
print(ans) | def ds(a, b):
return a if a<b else ds(a//b,b)+a%b
n = int(eval(input()))
print((min([ds(i,6)+ds(n-i,9) for i in range(n+1)]))) | p03329 |
N = int(eval(input()))
dp = [1e10]*(N+1)
dp[0] = 0
for i in range(1,N+1):
power = 1
while power <= i:
dp[i] = min(dp[i], dp[i-power]+1)
power *= 6
power = 1
while power<=i:
dp[i] = min(dp[i], dp[i-power]+1)
power *= 9
print((dp[N])) | N = int(eval(input()))
ans = N
for i in range(N+1):
cnt = 0
t = i
while t>0:
cnt+=t%6
t//=6
j=N-i
while j>0:
cnt+=j%9
j//=9
ans = min(ans,cnt)
print(ans) | p03329 |
def main():
n=int(eval(input()))
mon6=[6]
mon9=[1]
for i in range(5):
mon6.append(6*mon6[i])
mon9.append(9*mon9[i])
mon=mon6+mon9
mon.sort()
inf=10**9
dp=[[inf]*(n+1) for i in range(13)]
for i in range(13):
dp[i][0]=0
for i in range(12):
for j in range(1,n+1):
if j-mon[i]>=0:
dp[i+1][j]=min(dp[i+1][j-mon[i]]+1,dp[i][j])
else:
dp[i+1][j]=dp[i][j]
print((dp[-1][-1]))
if __name__=='__main__':
main() | import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
def main():
N = int(eval(input()))
money = [1]
for i in range(10):
money.append(money[-1]*6)
money.append(9)
for i in range(9):
money.append(money[-1]*9)
dp = [INF] * (1 + N)
dp[0] = 0
for m in money:
for j in range(m,N + 1):
dp[j] = min(dp[j],dp[j - m] + 1)
ans = dp[-1]
print(ans)
if __name__ == '__main__':
main() | p03329 |
n = int(eval(input()))
dp = [float('inf')] * 100010
dp[0] = 0
for i in range(1, 100000 + 1):
power = 1
while (power <= i):
dp[i] = min(dp[i], dp[i - power] + 1)
power *= 6
power = 1
while (power <= i):
dp[i] = min(dp[i], dp[i - power] + 1)
power *= 9
print((dp[n])) | def funcDP(n):
dp = [float('inf')] * (n + 10)
dp[0] = 0
for i in range(1, n + 1):
for base in [6, 9]:
powered = 1
while powered <= i:
dp[i] = min(dp[i], dp[i - powered] + 1)
powered *= base
return dp[n]
if __name__ == '__main__':
print((funcDP(int(eval(input()))))) | p03329 |
def funcDP(n):
dp = [float('inf')] * (n + 10)
dp[0] = 0
for i in range(1, n + 1):
for base in [6, 9]:
powered = 1
while powered <= i:
dp[i] = min(dp[i], dp[i - powered] + 1)
powered *= base
return dp[n]
if __name__ == '__main__':
print((funcDP(int(eval(input()))))) | def main():
inf = 1 << 30
N = int(eval(input()))
dp = [inf] * (N + 1)
dp[0] = 0
for i in range(1, N + 1):
t = inf
x = 1
while x <= i:
t = min(t, dp[i - x])
x *= 6
x = 1
while x <= i:
t = min(t, dp[i - x])
x *= 9
dp[i] = t + 1
print((dp[N]))
if __name__ == '__main__':
main()
| p03329 |
from math import log
N = int(eval(input()))
hiki9 = []
hiki6 = []
n = int(log(N) / log(9) + 1) # log9の計算に誤差があるので一つ多めに取っておく
for i in range(n+1):
hiki9.append(9**i)
n = int(log(N) / log(6) + 1)
for i in range(n+1):
hiki6.append(6**i)
hiki9.sort(reverse=True)
hiki6.sort(reverse=True)
x = []
for i in range(N+1):
n9 = i
tmpx = 0
for h in hiki9:
while h <= n9:
n9 -= h
tmpx += 1
n6 = N - i
for h in hiki6:
while h <= n6:
n6 -= h
tmpx += 1
x.append(tmpx)
x.sort()
print((x[0])) | N = int(eval(input()))
koho = [1]
i=1
while True:
if i > 1e6:
break
i *= 6
koho.append(i)
i=1
while True:
if i > 1e6:
break
i *= 9
koho.append(i)
dp = [0] * (N+1)
for i in range(1, N+1):
tmp = []
for k in koho:
if k > i:
continue
tmp.append(dp[i - k] + 1)
dp[i] = min(tmp)
print((dp[N])) | p03329 |
n=int(eval(input()))
n9=9**5
n6=6**6
k9=5+1
k6=6+1
n9=9**k9
smin=n
for i9 in range(n9):
ii9=i9
s=0
m=0
astr=""
for ii in range(1,k9+1):
r9=ii9%9
ii9=(ii9-r9)//9
s=s*9+r9
m=m+r9
astr=astr+str(r9)
# print("i9",i9,"astr",astr,"s",s,"m",m)
nr=n-s
nr1=nr
# print("nr",nr,"m",m)
if nr==0:
snra=m
# print(nr,m)
elif nr>0:
snra=m
for jj in range(k6,-1,-1):
nra=nr1//(6**jj)
nr1=nr1%(6**jj)
snra=snra+nra
# print("jj",jj,"nra",nra,"nr1",nr1)
if smin>snra:
smin=snra
print(smin) | n=int(eval(input()))
k9=5
k6=6
n9=9**k9
smin=n
for i9 in range(n9):
ii9=i9
s=0
m=0
astr=""
for ii in range(1,k9+2):
r9=ii9%9
ii9=(ii9-r9)//9
s=s*9+r9
m=m+r9
astr=astr+str(r9)
# print("i9",i9,"astr",astr,"s",s,"m",m)
nr=n-s
nr1=nr
# print("nr",nr,"m",m)
if nr==0:
snra=m
# print(nr,m)
elif nr>0:
snra=m
for jj in range(k6,-1,-1):
nra=nr1//(6**jj)
nr1=nr1%(6**jj)
snra=snra+nra
# print("jj",jj,"nra",nra,"nr1",nr1)
if smin>snra:
smin=snra
print(smin)
| p03329 |
n=int(eval(input()))
k9=5
k6=6
n9=9**k9
smin=n
for i9 in range(n9):
ii9=i9
s=0
m=0
astr=""
for ii in range(1,k9+2):
r9=ii9%9
ii9=(ii9-r9)//9
s=s*9+r9
m=m+r9
astr=astr+str(r9)
# print("i9",i9,"astr",astr,"s",s,"m",m)
nr=n-s
nr1=nr
# print("nr",nr,"m",m)
if nr==0:
snra=m
# print(nr,m)
elif nr>0:
snra=m
for jj in range(k6,-1,-1):
nra=nr1//(6**jj)
nr1=nr1%(6**jj)
snra=snra+nra
# print("jj",jj,"nra",nra,"nr1",nr1)
if smin>snra:
smin=snra
print(smin)
| n=int(eval(input()))
res=n
for i in range(n+1):
cc=0
t=i
while t>0:
cc=cc+t%6
t=t//6
t=n-i
while t>0:
cc=cc+t%9
t=t//9
if res>cc:
res=cc
print(res)
| p03329 |
import itertools,sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
if N<=5:
print(N)
exit()
dp = [float('INF')]*(N+1)
dp[0] = 0
num6,num9 = 6,9
d6d9 = set()
while num6<=N:
d6d9.add(num6)
num6 *= 6
while num9<=N:
d6d9.add(num9)
num9 *= 9
for i,x in itertools.product(list(range(N+1)),d6d9):
if i+x>=N+1:
continue
dp[i+1] = min(dp[i+1],dp[i]+1)
dp[i+x] = min(dp[i+x],dp[i]+1)
print((dp[-1]))
| import itertools,sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
dp = [float('INF')]*(N+1)
dp[0] = 0
for i in range(N+1):
if i+1<=N:
dp[i+1] = min(dp[i+1],dp[i]+1)
num6,num9 = 6,9
while i+num6<=N:
dp[i+num6] = min(dp[i+num6],dp[i]+1)
num6 *= 6
while i+num9<=N:
dp[i+num9] = min(dp[i+num9],dp[i]+1)
num9 *=9
print((dp[-1]))
| p03329 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
dp = [float('INF')]*(N+1) #1_indexed
dp[0] = 0
for i in range(N+1):
if i+1<=N:
dp[i+1] = min(dp[i+1],dp[i+1],dp[i]+1)
num6,num9 = 6,9
while i+num6<=N:
dp[i+num6] = min(dp[i+num6],dp[i]+1)
num6 *= 6
while i+num9<=N:
dp[i+num9] = min(dp[i+num9],dp[i]+1)
num9 *= 9
print((dp[-1]))
| import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
dp = [float('INF')]*(N+1) #1_indexed
dp[0] = 0
for i in range(N+1):
if i-1>=0:
dp[i] = min(dp[i],dp[i-1]+1)
num6,num9 = 6,9
while i-num6>=0:
dp[i] = min(dp[i],dp[i-num6]+1)
num6 *= 6
while i-num9>=0:
dp[i] = min(dp[i],dp[i-num9]+1)
num9 *= 9
print((dp[-1]))
| p03329 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = SR()
return l
mod = 1000000007
#A
def A():
return
#B
def B():
return
#C
def C():
n = I()
ans = float("inf")
for i in range(n+1):
m = 0
k = i
while k > 0:
m += k%6
k //= 6
k = n-i
while k > 0:
m += k%9
k //= 9
ans = min(ans,m)
print(ans)
#D
def D():
return
#E
def E():
return
#F
def F():
return
#G
def G():
return
#H
def H():
return
#Solve
if __name__ == "__main__":
C()
| #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LS()
return l
sys.setrecursionlimit(1000000)
mod = 1000000007
#A
def A():
n = I()
ans = float("inf")
for i in range(n+1):
m = 0
k = i
while k > 0:
m += k%6
k //= 6
k = n-i
while k > 0:
m += k%9
k //= 9
if m < ans:
ans = m
print(ans)
return
#B
def B():
return
#C
def C():
return
#D
def D():
return
#E
def E():
return
#F
def F():
return
#G
def G():
return
#H
def H():
return
#I
def I_():
return
#J
def J():
return
#Solve
if __name__ == "__main__":
A()
| p03329 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
# 解説動画通りにDPしてみる
dp = [0] * 100001
# dp[0] = 0
for n in range(1, 100001):
dp[n] = float("inf")
power = 1
while power <= n:
dp[n] = min(dp[n], dp[n-power] + 1)
power *= 6
power = 1
while power <= n:
dp[n] = min(dp[n], dp[n-power] + 1)
power *= 9
print((dp[N])) | # -*- coding: utf-8 -*-
N = int(eval(input()))
# ちょっと自分でいじった版
dp = [0] * (N+1)
for n in range(1, N+1):
dp[n] = float("inf")
power = 1
while power <= n:
dp[n] = min(dp[n], dp[n-power] + 1)
power *= 6
power = 1
while power <= n:
dp[n] = min(dp[n], dp[n-power] + 1)
power *= 9
print((dp[N])) | p03329 |
# -*- 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 range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
N = INT()
# dp[i] := i円引き出すのに必要な最小回数
dp = [INF] * (N+1)
dp[0] = 0
for i in range(N):
# 3種類の引き出し方に対応する遷移をする
dp[i+1] = min(dp[i+1], dp[i] + 1)
j = 1
while i+6**j <= N:
dp[i+6**j] = min(dp[i+6**j], dp[i] + 1)
j += 1
j = 1
while i+9**j <= N:
dp[i+9**j] = min(dp[i+9**j], dp[i] + 1)
j += 1
print((dp[N]))
| # -*- 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 range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
N = INT()
# dp[i] := i円引き出すのに必要な最小回数
dp = [INF] * (N+1)
dp[0] = 0
for i in range(N):
# 3種類の引き出し方に対応する遷移をする
dp[i+1] = min(dp[i+1], dp[i] + 1)
j = 6
while i+j <= N:
dp[i+j] = min(dp[i+j], dp[i] + 1)
j *= 6
j = 9
while i+j <= N:
dp[i+j] = min(dp[i+j], dp[i] + 1)
j *= 9
print((dp[N]))
| p03329 |
from itertools import count, takewhile
def dfs(n):
if n < 6:
return n
max9 = max(takewhile(lambda x: x<=n, (9**i for i in count())))
max6 = max(takewhile(lambda x: x<=n, (6**i for i in count())))
return min(dfs(n-max9), dfs(n-max6))+1
print((dfs(int(eval(input()))))) | from itertools import count, takewhile
def dfs(n, d={}):
if n < 6:
return n
if n in d:
return d[n]
max9 = max(takewhile(lambda x: x<=n, (9**i for i in count())))
max6 = max(takewhile(lambda x: x<=n, (6**i for i in count())))
d[n] = min(dfs(n-max9), dfs(n-max6))+1
return d[n]
print((dfs(int(eval(input()))))) | p03329 |
from itertools import count, takewhile
from functools import lru_cache
@lru_cache(maxsize=None)
def dfs(n):
if n == 0: return 0
max9 = max(takewhile(lambda x: x<=n, (9**i for i in count())))
max6 = max(takewhile(lambda x: x<=n, (6**i for i in count())))
return min(dfs(n-max9), dfs(n-max6))+1
print((dfs(int(eval(input()))))) | from itertools import count, takewhile, dropwhile
def dfs(n, max9, max6, d={0:0}):
if n in d: return d[n]
max9 = next(dropwhile(lambda x: x>n, (max9 / 9**i for i in count())))
max6 = next(dropwhile(lambda x: x>n, (max6 / 6**i for i in count())))
d[n] = min(dfs(n-max9, max9, max6), dfs(n-max6, max9, max6)) + 1
return d[n]
n = int(eval(input()))
max9 = max(takewhile(lambda x: x<=n, (9**i for i in count())))
max6 = max(takewhile(lambda x: x<=n, (6**i for i in count())))
print((dfs(n, max9, max6))) | p03329 |
import sys
six = [6,36,216,1296,7776,46656]
nine = [9,81,729,6561,59049]
def dfs(n):
if n < 6:
return n
six_max, nine_max = (1, 1)
for i in six:
if n < i:
break
six_max = i
for i in nine:
if n < i:
break
nine_max = i
ans = 123
if nine_max != 1:
ans = dfs(n - nine_max) + 1
if six_max != 1:
ans = min(ans, dfs(n - six_max) + 1)
return ans
print((dfs(int(eval(input())))))
| def dfs(n):
if n < 6:
return n
elif n < 9:
return 1 + dfs(n - 6)
six_max = 1
nine_max = 1
while six_max * 6 <= n:
six_max *= 6
while nine_max * 9 <= n:
nine_max *= 9
return min(dfs(n - nine_max), dfs(n - six_max)) + 1
print((dfs(int(eval(input())))))
| p03329 |
n = int(eval(input()))
INF = float("inf")
dp = [INF]*100010
dp[0] = 0
pow6 = [6**i for i in range(7)]
pow9 = [9**i for i in range(6)]
for i in range(1,n+1):
for p6 in pow6:
dp[i] = min(dp[i],dp[i-p6]+1)
for p9 in pow9:
dp[i] = min(dp[i],dp[i-p9]+1)
print((dp[n])) | n = int(eval(input()))
INF = float("inf")
dp = [INF]*100010
dp[0] = 0
pow6 = [6**i for i in range(1,7)]
pow9 = [9**i for i in range(1,6)]
for i in range(1,n+1):
dp[i] = dp[i-1] + 1
for p6 in pow6:
dp[i] = min(dp[i],dp[i-p6]+1)
for p9 in pow9:
dp[i] = min(dp[i],dp[i-p9]+1)
print((dp[n])) | p03329 |
n = int(eval(input()))
INF = float("inf")
dp = [INF]*100010
dp[0] = 0
pow6 = [6**i for i in range(1,7)]
pow9 = [9**i for i in range(1,6)]
for i in range(1,n+1):
dp[i] = dp[i-1] + 1
for p6 in pow6:
dp[i] = min(dp[i],dp[i-p6]+1)
for p9 in pow9:
dp[i] = min(dp[i],dp[i-p9]+1)
print((dp[n])) | n = int(eval(input()))
dp = [n]*100010
dp[0] = 0
pow69 = [6**i for i in range(1,7)] + [9**i for i in range(1,6)]
for i in range(1,n+1):
dp[i] = dp[i-1] + 1
for p in pow69:
dp[i] = min(dp[i],dp[i-p]+1)
print((dp[n])) | p03329 |
import math
N = int(eval(input()))
# A = [int(x) for x in input().split()]
C = [1]
for i in range(math.ceil(math.log(N,9)) + 3):
if i !=0 :
C.append(9 ** i)
for i in range(math.ceil(math.log(N,6)) + 3):
if i != 0:
C.append(6 ** i)
INF = 10**10
dp = [INF] * (N+1)
dp[0] = 0
for i in range(1,N+1):
for c in C:
if i - c >= 0:
dp[i] = min(dp[i], dp[i - c] + 1)
print((dp[N]))
| import math
N = int(eval(input()))
# A = [int(x) for x in input().split()]
C = [1]
for i in range(math.floor(math.log(N,9)) + 2):
if i !=0 :
C.append(9 ** i)
for i in range(math.floor(math.log(N,6)) + 2):
if i != 0:
C.append(6 ** i)
INF = 10**10
dp = [INF] * (N+1)
dp[0] = 0
for i in range(1,N+1):
for c in C:
if i - c >= 0:
dp[i] = min(dp[i], dp[i - c] + 1)
print((dp[N]))
| p03329 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
def ret_ans(n):
li = [1]
li.extend([6 ** i for i in range(0, 15) if 6 ** i <= n])
li.extend([9 ** i for i in range(1, 15) if 9 ** i <= n])
li.sort(reverse=True)
s = set([n])
cnt = 1
while True:
ts = set(s)
for e in li:
for c in s:
if c - e == 0:
return cnt
if c - e > 0:
ts.add(c - e)
s = ts
cnt += 1
def solve():
print((ret_ans(int(eval(input())))))
if __name__=="__main__":
solve()
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
def ret_ans(n):
li = [1]
li.extend([6 ** i for i in range(1, 15) if 6 ** i <= n])
li.extend([9 ** i for i in range(1, 15) if 9 ** i <= n])
li.sort(reverse=True)
s = set([n])
cnt = 1
while True:
ts = set(s)
for e in li:
for c in s:
if c - e == 0:
return cnt
if c - e > 0:
ts.add(c - e)
s = ts
cnt += 1
def solve():
print((ret_ans(int(eval(input())))))
if __name__=="__main__":
solve()
| p03329 |
N=int(eval(input()))
inf=100000
dp=[inf for _ in range(N+1)]
dp[0]=0
for n in range(1,N+1):
num=100000
i=0
j=0
while 9**(i+1)<=n:
i+=1
while 6**(j+1)<=n:
j+=1
for k in range(i+1):
num=min(num,dp[n-9**k]+1)
for k in range(j+1):
num=min(num,dp[n-6**k]+1)
dp[n]=min(dp[n],num)
print((dp[N])) | def main3():
import sys
sys.setrecursionlimit(100000000)
N=int(eval(input()))
dp=[-1 for n in range(N+1)]
dp[0]=0
dp[1]=1
def rec(x,dp):
if x==1:
return dp[1]
elif x==0:
return dp[0]
else:
l=[]
i=0
j=0
while 9**(i+1)<=x:
i+=1
while 6**(j+1)<=x:
j+=1
for k in reversed(list(range(i+1))):
tmp=x-9**k
if dp[tmp]!=-1:
l.append(dp[tmp]+1)
else:
l.append(rec(tmp,dp)+1)
for k in reversed(list(range(j+1))):
tmp=x-6**k
if dp[tmp]!=-1:
l.append(dp[tmp]+1)
else:
l.append(rec(tmp,dp)+1)
dp[x]=min(l)
return dp[x]
return rec(N,dp)
if __name__=="__main__":
print((main3())) | p03329 |
n = int(eval(input()))
dp = [float("Inf")]*(n+1)
dp[0] = 0
for i in range(n):
for j in range(1,6):
if i + j > n:
break
dp[i+j] = min(dp[i+j], dp[i] + j)
for j in range(1,n//6+1):
if i + 6**j > n:
break
dp[i+6**j] = min(dp[i+6**j], dp[i] + 1)
for j in range(1,n//9+1):
if i + 9**j > n:
break
dp[i+9**j] = min(dp[i+9**j], dp[i] + 1)
print((dp[-1])) | n = int(eval(input()))
dp = [float("Inf")]*(n+1)
for i in range(min(6, n+1)):
dp[i] = i
for i in range(n):
for j in range(1,n//6+1):
if i + 6**j > n:
break
dp[i+6**j] = min(dp[i+6**j], dp[i] + 1)
for j in range(1,n//9+1):
if i + 9**j > n:
break
dp[i+9**j] = min(dp[i+9**j], dp[i] + 1)
print((dp[-1])) | p03329 |
N = int(eval(input()))
l = [1] + [6 ** x for x in range(1, 7)] + [9 ** x for x in range(1, 6)]
l.sort()
INF = 10 ** 3
dp = [0] + [INF] * N
for n in range(1, N + 1):
#for f in [1, 6, 9, 6 ** 2, 9 ** 2, 6 ** 3, 9 ** 3]:
for f in l:
if 0 <= n - f:
dp[n] = min([dp[n], dp[n - f] + 1])
#print(dp)
print((dp[-1]))
| N = int(eval(input()))
l = [1] + [6 ** x for x in range(1, 7)] + [9 ** x for x in range(1, 6)]
l.sort()
INF = 10 ** 3
dp = [0] * (N + 1)
for n in range(1, N + 1):
dp[n] = min([dp[n - f] + 1 if 0 <= n - f else INF for f in l])
#print(dp)
print((dp[-1]))
| p03329 |
import sys
def f(n):
X6 = []
X9 = []
for i in range(1, 10):
if n >= 6**i:
X6.append(6**i)
if n >= 9**i:
X9.append(9**i)
return X6, X9
def main():
input = sys.stdin.readline
N = int(eval(input()))
dp = [0 for _ in range(N+1)]
for i in range(1, N+1):
can = []
X6, X9 = f(i)
X = [1] + X6 + X9
for x in X:
can.append(dp[i-x] + 1)
dp[i] = min(can)
print((dp[N]))
if __name__ == '__main__':
main() | import sys
def f(n):
X6 = []
X9 = []
for i in range(0, 10):
if n >= 6**i:
X6.append(6**i)
if n >= 9**i:
X9.append(9**i)
return max(X6), max(X9)
def main():
input = sys.stdin.readline
N = int(eval(input()))
dp = [0 for _ in range(N+1)]
for i in range(1, N+1):
can = []
max6, max9 = f(i)
X = [1, max6, max9]
for x in X:
can.append(dp[i-x] + 1)
dp[i] = min(can)
print((dp[N]))
if __name__ == '__main__':
main() | p03329 |
import sys
def f(n):
X6 = []
X9 = []
for i in range(0, 10):
if n >= 6**i:
X6.append(6**i)
if n >= 9**i:
X9.append(9**i)
return max(X6), max(X9)
def main():
input = sys.stdin.readline
N = int(eval(input()))
dp = [0 for _ in range(N+1)]
for i in range(1, N+1):
can = []
max6, max9 = f(i)
X = [1, max6, max9]
for x in X:
can.append(dp[i-x] + 1)
dp[i] = min(can)
print((dp[N]))
if __name__ == '__main__':
main() | import sys
from itertools import count, takewhile
def dfs(n, d={}):
if n < 6:
return n
if n in d:
return d[n]
max9 = max(takewhile(lambda x: x<=n, (9**i for i in count())))
max6 = max(takewhile(lambda x: x<=n, (6**i for i in count())))
d[n] = min(dfs(n-max9), dfs(n-max6)) + 1
return d[n]
def main():
input = sys.stdin.readline
N = int(eval(input()))
print((dfs(N)))
if __name__ == '__main__':
main() | p03329 |
N=int(eval(input()))
A=[]
for i in range(1,10):
if 6**i<=100000:
A.append(6**i)
if 9**i<=100000:
A.append(9**i)
L=[i for i in range(100001)]
A.sort()
for i in range(len(A)):
for j in range(1,100001):
if j>=A[i]:
L[j]=min(L[j],L[j-A[i]]+1)
print((L[N])) | N=int(eval(input()))
C=[1]
for i in range(1,100):
if 6**i<=100000:
C.append(6**i)
else:
break
for i in range(1,100):
if 9**i<=100000:
C.append(9**i)
else:
break
dp=[10**6 for i in range(N+1)]
dp[0]=0
for i in C:
for j in range(1,len(dp)):
if j-i>=0:
dp[j]=min(dp[j],dp[j-i]+1)
print((dp[N])) | p03329 |
import copy
N=eval(input())
def nine(m):
if m<9: return m
for i in range(1000):
t=9**i
if t>m:
t1=9**(i-1)
return m-t1
def six(m):
if m<6: return m
for i in range(1000):
t=6**i
if t>m:
t2=6**(i-1)
return m-t2
Z=15
k=1<<Z
b=set()
for i in range(k):
n=copy.deepcopy(N)
ans=0
for j in range(Z):
if n<6:
b.add(ans+n)
break
if i&(1<<j)!=0:
#9
n=nine(n)
ans+=1
else:
#6
n=six(n)
ans+=1
print(min(b))
| N=eval(input())
dp=[ float("inf") for i in range(N+1) ]
dp[0]=0
i=1
for i in range(1,8):
for n in range(N):
if n+ 9**i <=N: dp[ n+ 9**i ]=min( dp[n]+1, dp[ n+9**i ] )
if n+ 6**i <=N: dp[ n+ 6**i ]=min( dp[n]+1, dp[ n+6**i ] )
if n+ 1 <=N: dp[ n+ 1 ]=min( dp[n]+1, dp[ n+1 ] )
print(dp[N]) | p03329 |
import sys
sys.setrecursionlimit(101000)
N=eval(input())
memo={}
def dp(n):
ret=float("inf")
if n==0: return 0
if n<0: return float("inf")
if n in memo: return memo[n]
for k in range(1,8):
t=min(dp(n-6**k)+1,dp(n-9**k)+1,dp(n-1)+1)
ret=min(ret,t)
memo[n]=ret
return ret
#print dp(8)
#print dp(12)
#print dp(83)
#print dp(N)
dp(N)
print(memo[N])
| N=eval(input())
nl=[]
nl.append(1)
for i in range(1,7): nl.append(6**i)
for i in range(1,6): nl.append(9**i)
dp=[ float("inf") for i in range(N+1)]
dp[0]=0
for i in range(N+1):
for dx in nl:
if i+dx<=N:
dp[i+dx]=min(dp[i+dx], dp[i]+1)
print(dp[N]) | p03329 |
N=eval(input())
nl=[]
nl.append(1)
for i in range(1,7): nl.append(6**i)
for i in range(1,6): nl.append(9**i)
dp=[ float("inf") for i in range(N+1)]
dp[0]=0
for i in range(N+1):
for dx in nl:
if i+dx<=N:
dp[i+dx]=min(dp[i+dx], dp[i]+1)
print(dp[N]) | # -*- coding: utf-8 -*-
N=eval(input())
dp=[ float("inf") for _ in range(N+1) ]
dp[0]=0
#1円
for i in range(N+1):
if i+1<=N:
dp[i+1]=min(dp[i+1],dp[i]+1)
#6円
for k in range(1,10**5):
yen=6**k
for i in range(N+1):
if i+yen<=N:
dp[i+yen]=min(dp[i+yen],dp[i]+1)
if N<=yen:break
#9円
for k in range(1,10**5):
yen=9**k
for i in range(N+1):
if i+yen<=N:
dp[i+yen]=min(dp[i+yen],dp[i]+1)
if N<=yen:break
print(dp[N])
| p03329 |
max_n = 100000
N = int(eval(input()))
dp = [N for _ in range(N+1)]
dp[0] = 0
for n in range(1, N+1):
for pow6 in range(n+1):
if 6 ** pow6 <= n:
dp[n] = min(dp[n], dp[n - 6 ** pow6] + 1)
else:
break
for pow9 in range(n+1):
if 9 ** pow9 <= n:
dp[n] = min(dp[n], dp[n - 9 ** pow9] + 1)
else:
break
print((dp[N]))
| N = int(eval(input()))
one = [1]
six_multi = [6, 6**2, 6**3, 6**4, 6**5, 6**6]
nine_multi = [9, 9**2, 9**3, 9**4, 9**5]
deposit = one + six_multi + nine_multi
dp = [10**10 for _ in range(N+1)]
dp[0] = 0
for i in range(0, N):
for d in range(len(deposit)):
if i+deposit[d] <= N:
dp[i+deposit[d]] = min(dp[i+deposit[d]], dp[i] + 1)
print((dp[N]))
| p03329 |
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(eval(input())) #整数読み込み
def ifn(): return float(eval(input())) #浮動小数点読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return list(map(int, input().split())) #整数map取得
def fmn(): return list(map(float, input().split())) #浮動小数点map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, input().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
MAX_N = 110000
N = iin()
dp = [10**10 for _ in range(MAX_N)]
dp[0] = 0
for i in range(0, N):
pow6 = 1
while i + pow6 <= N:
dp[i+pow6] = min(dp[i+pow6], dp[i]+1)
pow6 *= 6
pow9 = 1
while i + pow9 <= N:
dp[i+pow9] = min(dp[i+pow9], dp[i]+1)
pow9 *= 9
print((dp[N]))
| import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(eval(input())) #整数読み込み
def ifn(): return float(eval(input())) #浮動小数点読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return list(map(int, input().split())) #整数map取得
def fmn(): return list(map(float, input().split())) #浮動小数点map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, input().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
MAX_N = 110000
N = iin()
dp = [-1 for _ in range(MAX_N)]
dp[0] = 0
que = collections.deque()
que.append(0)
while (len(que) != 0):
v = que.popleft()
pow6 = 1
while v+pow6 <= N:
if dp[v+pow6] == -1:
dp[v+pow6] = dp[v] + 1
que.append(v+ pow6)
pow6 *= 6
pow9 = 1
while v+pow9 <= N:
if dp[v+pow9] == -1:
dp[v+pow9] = dp[v] + 1
que.append(v+pow9)
pow9 *= 9
print((dp[N])) | p03329 |
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(sys.stdin.readline()) #整数読み込み
def ifn(): return float(sys.stdin.readline()) #浮動小数点読み込み
def isn(): return sys.stdin.readline().split() #文字列読み込み
def imn(): return map(int, sys.stdin.readline().split()) #整数map取得
def imnn(): return map(lambda x:int(x)-1, sys.stdin.readline().split()) #整数-1map取得
def fmn(): return map(float, sys.stdin.readline().split()) #浮動小数点map取得
def iln(): return list(map(int, sys.stdin.readline().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, sys.stdin.readline().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
def print_list(l): print(*l, sep='\n')
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def No(): print('No')
def sieves_of_e(n):
is_prime = [True] * (n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)+1):
if not is_prime[i]: continue
for j in range(i * 2, n+1, i): is_prime[j] = False
return is_prime
N = iin()
dp = [INF for _ in range(N+1)]
dp[0] = 0
for i in range(N):
pow6 = 1
while i+pow6 < N+1:
dp[i+pow6] = min(dp[i+pow6], dp[i]+1)
pow6 *= 6
pow9 = 1
while i+pow9 < N+1:
dp[i+pow9] = min(dp[i+pow9], dp[i]+1)
pow9 *= 9
print(dp[N])
| import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(sys.stdin.readline()) #整数読み込み
def ifn(): return float(sys.stdin.readline()) #浮動小数点読み込み
def isn(): return sys.stdin.readline().split() #文字列読み込み
def imn(): return map(int, sys.stdin.readline().split()) #整数map取得
def imnn(): return map(lambda x:int(x)-1, sys.stdin.readline().split()) #整数-1map取得
def fmn(): return map(float, sys.stdin.readline().split()) #浮動小数点map取得
def iln(): return list(map(int, sys.stdin.readline().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, sys.stdin.readline().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
def print_list(l): print(*l, sep='\n')
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def No(): print('No')
def sieves_of_e(n):
is_prime = [True] * (n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)+1):
if not is_prime[i]: continue
for j in range(i * 2, n+1, i): is_prime[j] = False
return is_prime
N = iin()
dp = [-1 for _ in range(N+1)]
dp[0] = 0
queue = deque([0])
while len(queue) > 0:
current = queue.popleft()
pow6 = 1
while current+pow6 <= N:
if dp[current+pow6] == -1:
queue.append(current+pow6)
dp[current+pow6] = dp[current]+1
pow6 *= 6
pow9 = 1
while current+pow9 <= N:
if dp[current+pow9] == -1:
queue.append(current+pow9)
dp[current+pow9] = dp[current]+1
pow9 *= 9
print(dp[N])
| p03329 |
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(sys.stdin.readline()) #整数読み込み
def ifn(): return float(sys.stdin.readline()) #浮動小数点読み込み
def isn(): return sys.stdin.readline().split() #文字列読み込み
def imn(): return map(int, sys.stdin.readline().split()) #整数map取得
def imnn(): return map(lambda x:int(x)-1, sys.stdin.readline().split()) #整数-1map取得
def fmn(): return map(float, sys.stdin.readline().split()) #浮動小数点map取得
def iln(): return list(map(int, sys.stdin.readline().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, sys.stdin.readline().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
def print_list(l): print(*l, sep='\n')
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def No(): print('No')
def sieves_of_e(n):
is_prime = [True] * (n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)+1):
if not is_prime[i]: continue
for j in range(i * 2, n+1, i): is_prime[j] = False
return is_prime
N = iin()
money = []
pow6 = 1
while pow6 <= N:
money.append(pow6)
pow6 *= 6
pow9 = 9
while pow9 <= N:
money.append(pow9)
pow9 *= 9
lm = len(money)
dp = [[INF for _ in range(N+1)] for _ in range(lm+1)]
dp[0][0] = 0
for i in range(lm):
for j in range(N+1):
dp[i+1][j] = dp[i][j]
if j - money[i] >= 0:
dp[i+1][j] = min(dp[i+1][j], dp[i+1][j-money[i]]+1)
print(dp[lm][N])
| import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(sys.stdin.readline()) #整数読み込み
def ifn(): return float(sys.stdin.readline()) #浮動小数点読み込み
def isn(): return sys.stdin.readline().split() #文字列読み込み
def imn(): return map(int, sys.stdin.readline().split()) #整数map取得
def imnn(): return map(lambda x:int(x)-1, sys.stdin.readline().split()) #整数-1map取得
def fmn(): return map(float, sys.stdin.readline().split()) #浮動小数点map取得
def iln(): return list(map(int, sys.stdin.readline().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, sys.stdin.readline().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
def print_list(l): print(*l, sep='\n')
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def No(): print('No')
def sieves_of_e(n):
is_prime = [True] * (n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)+1):
if not is_prime[i]: continue
for j in range(i * 2, n+1, i): is_prime[j] = False
return is_prime
N = iin()
money = []
pow6 = 1
while pow6 <= N:
money.append(pow6)
pow6 *= 6
pow9 = 9
while pow9 <= N:
money.append(pow9)
pow9 *= 9
lm = len(money)
dp = [INF for _ in range(N+1)]
dp[0] = 0
for i in range(lm):
for j in range(N+1):
if j - money[i] >= 0:
dp[j] = min(dp[j], dp[j-money[i]]+1)
print(dp[N])
| p03329 |
import math
N = int(eval(input()))
def Nsinpou(x, base):
#配列を返す Nsin[0]が上位桁 ex. 56(base=6) => [1,3,2]
if x == 0: return [0] #log_n(0)の回避
Nsin = []
for i in range((int(round(math.log(x,base))//1)+1)):
ithdigit = x%(base**(i+1)) // (base ** i)
Nsin.append(ithdigit)
Nsin.reverse()
return Nsin
ans = N #最大でも1円玉N枚
for i in range(N+1): #分け方全探索
coins = sum(Nsinpou(i,6)) + sum(Nsinpou(N-i,9))
if coins < ans:
ans = coins
print(ans) | MAX_N = 10**5
N = int(eval(input()))
dp = [MAX_N]*(N+1)
dp[0] = 0
dp[1] = 1
MONEY_LIST = [6**i for i in range(7)]
MONEY_LIST.extend([9**i for i in range(1,6)])
MONEY_LIST.sort()
for i in range(N+1):
for m in MONEY_LIST:
if m>i:
break
dp[i] = min(dp[i],dp[i-m]+1)
print((dp[N])) | p03329 |
MAX_N = 10**5
N = int(eval(input()))
dp = [MAX_N]*(N+1)
dp[0] = 0
dp[1] = 1
MONEY_LIST = [6**i for i in range(7)]
MONEY_LIST.extend([9**i for i in range(1,6)])
MONEY_LIST.sort()
for i in range(N+1):
for m in MONEY_LIST:
if m>i:
break
dp[i] = min(dp[i],dp[i-m]+1)
print((dp[N])) | from itertools import count, takewhile
def dfs(n:int, d={}) -> int:
if n<6:
return n
if n in d:
return d[n]
max9 = max(takewhile(lambda x: x<=n, (9**i for i in count())))
max6 = max(takewhile(lambda x: x<=n, (6**i for i in count())))
d[n] = min(dfs(n-max9), dfs(n-max6))+1
return d[n]
print((dfs(int(eval(input()))))) | p03329 |
N = int(eval(input()))
A = [1]
for k in range(1,7):
A.append(6**k)
for k in range(1,6):
A.append(9**k)
dp = [[0 for _ in range(len(A))] for _ in range(N+1)]
for i in range(N+1):
dp[i][0] = i
for j in range(len(A)):
dp[1][j] = 1
for i in range(2,N+1):
for j in range(1,len(A)):
if i>=A[j]:
dp[i][j] = min(dp[i][j-1],dp[i-A[j]][j]+1)
else:
dp[i][j] = dp[i][j-1]
print((dp[N][len(A)-1])) | memo = {}
def f(x):
if 0<=x<=5:
return x
if x in memo:
return memo[x]
k = 0
while 9**k<=x:
k += 1
m = 0
while 6**m<=x:
m += 1
memo[x] = min(f(x-9**(k-1))+1,f(x-6**(m-1))+1)
return memo[x]
print((f(int(eval(input()))))) | p03329 |
from collections import Counter,defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
n = inp()
dp = [mod for i in range(2*n)]
dp[0] = 0
p_6 = []
p_9 = []
tmp = 1
while tmp <= n:
p_6.append(tmp)
tmp *= 6
tmp = 1
while tmp <= n:
p_9.append(tmp)
tmp *= 9
for i in range(n):
for j in p_6:
if i+j <= n:
dp[i+j] = min(dp[i+j],dp[i]+1)
for k in p_9:
if i+k <= n:
dp[i+k] = min(dp[i+k],dp[i]+1)
print((dp[n]))
| from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
res = [INF] * (n+1)
res[0] = 0
ge = [1]
for i in [6,9]:
now = 1
while True:
now *= i
if now > n:
break
ge.append(now)
ge.sort()
for i in range(1,n+1):
for x in ge:
if x > i:
continue
res[i] = min(res[i], res[i-x]+1)
print((res[n])) | p03329 |
def solve():
N = int(eval(input()))
dp = [float('inf')] * (N+1)
dp[0] = 0
for i in range(N):
k = 0
while 6 ** k + i<= N:
dp[6 ** k + i] = min(dp[6**k + i], dp[i] + 1)
k += 1
k = 0
while 9 ** k + i <= N:
dp[9 ** k + i] = min(dp[9**k+i], dp[i] + 1)
k += 1
dp[i+1] = min(dp[i+1], dp[i] + 1)
print((dp[-1]))
if __name__ == '__main__':
solve()
| def solve():
N = int(eval(input()))
dp = [float('inf')] * (N+1)
dp[0] = 0
for i in range(1,N+1):
# 1yen
dp[i] = min(dp[i], dp[i-1]+1)
# 6 ** n yen
n = 1
while i - pow(6,n) >= 0:
dp[i] = min(dp[i], dp[i-pow(6,n)]+1)
n += 1
# 9 ** n yen
n = 1
while i - pow(9,n) >= 0:
dp[i] = min(dp[i], dp[i-pow(9,n)]+1)
n += 1
print((dp[-1]))
if __name__ == '__main__':
solve() | p03329 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.