input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from bisect import bisect_right
n = int(eval(input()))
l = [1]
i = 1
while 6 ** i <= 100000:
l.append(6 ** i)
i += 1
i = 1
while 9 ** i <= 100000:
l.append(9 ** i)
i += 1
l.sort()
dp = [float('inf')] * (n+1)
dp[0] = 0
for i in range(1, n+1):
for v in l:
if v > i:
... | n = int(eval(input()))
l = [1]
i = 1
while 6 ** i <= 100000:
l.append(6 ** i)
i += 1
i = 1
while 9 ** i <= 100000:
l.append(9 ** i)
i += 1
l.sort()
dp = [float('inf')] * (n+1)
dp[0] = 0
for i in range(1, n+1):
for v in l:
if v > i:
break
dp[i] = min(d... | p03329 |
lis = [1]
cou = 1
n = int(eval(input()))
while 6 ** cou <= n:
lis.append(6**cou)
cou += 1
cou = 1
while 9 ** cou <= n:
lis.append(9**cou)
cou += 1
lis.sort(reverse = True)
now = {0}
for i in range(n):
gone = set()
for num in now:
for k in range(len(lis)):
gone.add(num + lis[k])... | n = int(eval(input()))
lis = [1, 6, 36, 216, 1296, 7776, 46656,9, 81, 729, 6561, 59049]
lis.sort(reverse=True)
dp = [10 ** 10 for i in range(n+1)]
dp[0] = 0
for i in range(n):
for num in lis:
try:
dp[i+num] = min(dp[i+num],dp[i]+1)
except:
continue
print((dp[n])) | p03329 |
n = int(eval(input()))
possible = [1]
i=1
while i <= 100000:
i = i*6
possible+=[i]
i=1
while i <= 100000:
i = i*9
possible+=[i]
possible.sort(reverse =1)
ans = 1
table = set(possible)
while True:
if n in table:
print(ans)
break
ans+=1
nexttable = set()
for num in table:
f... | n = int(eval(input()))
possible = [1]
i=1
while i <= 100000:
i = i*6
possible+=[i]
i=1
while i <= 100000:
i = i*9
possible+=[i]
possible.sort(reverse =1)
ans = 0
table = set([n])
while True:
if 0 in table:
print(ans)
break
ans+=1
nexttable = set()
for num in table:
for p ... | p03329 |
n = int(eval(input()))
dp = [10**9]*30000000
dp[0] = 0
pow6 = [6**i for i in range(10) if 6**i <= n]
pow9 = [9**i for i in range(10) if 9**i <= n]
for i in range(n):
for p6 in pow6:
dp[i+p6] = min(dp[i+p6], dp[i]+1)
for p9 in pow9:
dp[i+p9] = min(dp[i+p9], dp[i]+1)
print((dp[n]))
| from bisect import bisect_right
n = int(eval(input()))
MX = 100010
dp = [float('inf') for _ in range(MX)]
dp[0] = 0
pow_6, pow_9 = [6], [9]
while True:
flg = False
if pow_6[-1]*6 <= MX:
pow_6.append(pow_6[-1]*6)
flg = True
if pow_9[-1]*9 <= MX:
pow_9.append(pow_9[-1]*9)
... | p03329 |
n = int(eval(input()))
max_n = 10 ** 5
dp = [int(i) for i in range(max_n + 1)]
for i in (6,9):
v = i
while v < max_n:
for j in range(len(dp)):
if j + v < max_n+1:
dp[j+v] = min(dp[j+v],dp[j]+1)
v *= i
print((dp[n])) | n = int(eval(input()))
dp = [int(i) for i in range(10 ** 5 + 1)]
for i in [6,9]:
v = i
while v < 10 ** 5:
for j in range(len(dp)):
if j+v <= 10 ** 5:
dp[j+v] =min(dp[j]+1,dp[j+v])
v *= i
print((dp[n])) | p03329 |
l_6 = []
_ = 1
while 6**_ < 100000:
l_6.append(6**_)
_ += 1
l_6.sort(reverse = 1)
l_9= []
_ = 1
while 9**_ < 100000:
l_9.append(9**_)
_ += 1
l_9.sort(reverse = 1)
n = int(eval(input()))
w = 0
z = []
for i in range(n+1):
x = i
for j in range(len(l_6)):
while l_6[j]... | n = int(eval(input()))
dp = [0] + [100000]*n
ptn = [1]
_ = 1
while 6**_ < 100000:
ptn.append(6**_)
_ += 1
_ = 1
while 9**_ < 100000:
ptn.append(9**_)
_ += 1
for i in range(1,n+1):
for j in ptn:
if i-j >= 0:
dp[i] = min(dp[i], dp[i-j]+1)
print((dp[-1])) | p03329 |
n_max = 100000
bs = [(6 ** i, 6) for i in range (1, 10)]
bs.extend([(9 ** i, 9) for i in range (1, 10)])
bs = list(sorted([x for x in bs if x[0] <= n_max]))
bms = []
s = 5
for b, i in bs:
s += b * (i - 1)
bms.append((b, i, s))
#print(bs)
#print(bms, len(bms))
#m = 44852
m = int(eval(input()))
... | n_max = 100000
bs = [(6 ** i, 6) for i in range (1, 10)]
bs.extend([(9 ** i, 9) for i in range (1, 10)])
bs = list(sorted([x for x in bs if x[0] <= n_max]))
bms = []
s = 5
for b, i in bs:
s += b * (i - 1)
bms.append((b, i, s))
#print(bs)
#print(bms, len(bms))
#m = 44852
m = int(eval(input()))
... | p03329 |
import bisect
n = int(eval(input()))
add_num = 1
draw_money = []
while add_num <= 10 ** 5:
draw_money.append(add_num)
add_num *= 6
add_num = 1
while add_num <= 10 ** 5:
draw_money.append(add_num)
add_num *= 9
#重複を削除
draw_money = list(set(draw_money))
ans = 0
draw_money.sort()
# dp... | n = int(eval(input()))
inf = 10**9
dp = [inf for i in range(n+1)]
dp[0] = 0
for i in range(n):
if dp[i] != inf:
#1円引き出す場合
dp[i+1] = min(dp[i] + 1, dp[i+1])
num = 6
while i + num <= n:
dp[i + num] = min(dp[i] + 1, dp[i+num])
num *= 6
num = 9... | p03329 |
INF=9999999
n=int(eval(input()))
dp=[INF for i in range(n+1)]
dp[-1]=0
for i in range(n,0,-1):
e6=1
while 6**e6<=i:
dp[i-6**e6]=min(dp[i]+1,dp[i-6**e6])
e6+=1
e9=1
while 9**e9<=i:
dp[i-9**e9]=min(dp[i]+1,dp[i-9**e9])
e9+=1
ans=INF
for i in range(n):
i... | #補助関数
def convert(num,radix):
res = 0
while num > 0:
res += num % radix
num //= radix
return res
#入力
INF = (1 << 31)
N = int(eval(input()))
ans = INF
#計算
for i in range(N + 1):
dec6 = i
dec9 = N - i
ans = min(ans , convert(dec6,6) + convert(dec9,9))
#出力
... | p03329 |
N=int(eval(input()))
X=[1]+[6**i for i in range(1,7)]+[9**i for i in range(1,6)]
X.sort()
X.reverse()
DP=[i for i in range(100001)]
def dpmin(i):
Y=i
for j in X:
if i-j>=0:
Y=min(Y,DP[i-j]+1)
return Y
for i in range(100001):
DP[i]=dpmin(i)
print((DP[N]))
| N=int(eval(input()))
X=[1]+[6**i for i in range(1,7)]+[9**i for i in range(1,6)]
X.sort()
X.reverse()
ANS=1000000
i=4
for i_0 in range(max(N//X[0]-i,0),N//X[0]+1):
N_0=N-X[0]*i_0
for i_1 in range(max(N_0//X[1]-i,0),N_0//X[1]+1):
N_1=N_0-X[1]*i_1
for i_2 in range(max(N... | p03329 |
bank = [1]
N = int(eval(input()))
for i in range(20):
if 100000 >= 6**i:
bank.append(6**i)
if 100000 >= 9**i:
bank.append(9**i)
# print(bank)
dp = [[10**10]*(N+1) for _ in range(len(bank)+1)]
dp[0][0] = 0
# i番目の引き出し方法を使う
for i in range(len(bank)):
for j in range(N+1):
... | # from math import log
n = int(eval(input()))
# def make_list(n, x):
# return [x ** i for i in range(1, int(log(n, x))+1)]
nums = [1]
# N = int(input())
for i in range(20):
if 100000 >= 6**i:
nums.append(6**i)
if 100000 >= 9**i:
nums.append(9**i)
# sixes = make_list(n, 6)
#... | p03329 |
n=int(eval(input()))
l=[1]
for i in [6,9]:
x=i
while x<=n:
l.append(x)
x*=i
dp=[10**9]*(n+1)
dp[0]=0
for x in l:
for i in range(n):
if i+x<=n:dp[i+x]=min(dp[i+x],dp[i]+1)
print((dp[n]))
| n=int(eval(input()))
l=[1]
for i in [6,9]:
x=i
while x<=n:
l.append(x)
x*=i
dp=[10**9]*(n+1)
dp[0]=0
for x in l:
for i in range(n):
if i+x<=n:dp[i+x]=min(dp[i+x],dp[i]+1)
else:break
print((dp[n]))
| p03329 |
N = int(eval(input()))
ans = N
for v9 in range(N + 1):
cnt = 0
t = v9
w = 9 ** 5
while t >= 9:
if t >= w:
cnt9, t = divmod(t, w)
cnt += cnt9
w //= 9
t = N - (v9 - t)
w = 6 ** 7
while t >= 6:
if t >= w:
cnt6, t = div... | N = int(eval(input()))
ans = N
for i in range(N + 1):
cnt = 0
t = i
while t > 0:
cnt += t % 9
t //= 9
t = N - i
while t > 0:
cnt += t % 6
t //= 6
ans = min(ans, cnt)
print(ans)
| p03329 |
def s(n,c):
if n<6:return c+n
a=b=1
while a*6<=n:a*=6
while b*9<=n:b*=9
return min(s(n-a,c+1),s(n-b,c+1))
print((s(int(eval(input())),0))) | def s(n,p):
while n>0:yield n%p;n//=p
c=lambda*a:sum(s(*a));n=int(eval(input()));print((min(c(i,6)+c(n-i,9)for i in range(n+1)))) | p03329 |
n = int(eval(input()))
m = [1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049]
dp = [10**6 for i in range(100001)]
for mi in m:
dp[mi] = 1
for i in range(1,100001):
for mi in m:
if i+mi <= 100000:
dp[i+mi] = min(dp[i+mi],dp[i]+1)
else:
break
print((dp[n... | N = int(eval(input()))
li = [1]
six = 1
while six <= N:
six = six*6
li.append(six)
nine = 1
while nine <= N:
nine = nine*9
li.append(nine)
INF = 10**10
dp = [INF for i in range(N+1)]
dp[0] = 0
for i in range(N):
for num in li:
if i+num <= N:
dp[i+num] = ... | p03329 |
N = int(eval(input()))
def six(n):
count = 0
while n > 5:
x = n
a = 0
while x >= 1:
x = x / 6
a += 1
a -= 1
n -= 6 ** a
count += 1
count += n
return count
def nine(n):
count = 0
while n > 8:
x = n
a = 0
while x >= 1:
x = x / 9
... | import bisect
N = int(eval(input()))
six = []
nine = []
now = 6
while now < 100001:
six.append(now)
now *= 6
now = 9
while now < 100001:
nine.append(now)
now *= 9
#print(six, nine)
#[6, 36, 216, 1296, 7776, 46656] [9, 81, 729, 6561, 59049]
def coin(n):
if n < 6:
return n
... | p03329 |
N = int(eval(input()))
r = N
for i in range(N+1):
c=0;t=i
while t>0:c+=t%6;t//=6
t=N-i
while t>0:c+=t%9;t//=9
r=min(r,c)
print(r) | N = int(eval(input()))
a = N
for n in range(N+1):
c = 0
t = n
while t>0:
c+=t%6
t//=6
t = N-n
while t>0:
c+=t%9
t//=9
a = min(a,c)
print(a) | p03329 |
N = int(eval(input()))
s = set()
a = 1
while a <= 100000:
s.add(a)
a *= 6
a = 1
while a <= 100000:
s.add(a)
a *= 9
s = sorted(s)
INF = float('inf')
dp = [INF] * (N+1)
dp[0] = 0
for i in range(N):
for a in s:
if i+a > N: break
dp[i+a] = min(dp[i+a], dp[i] + 1)
pr... | import sys
sys.setrecursionlimit(10**8)
N = int(eval(input()))
ss = set()
n = 6
while n <= 10**5:
ss.add(n)
n *= 6
n = 9
while n <= 10**5:
ss.add(n)
n *= 9
dp = [None] * (N+1)
def rec(n):
if dp[n] is not None:
return dp[n]
tmp = n
for s in ss:
if s >... | p03329 |
def main():
N = int(eval(input()))
dp = [float('inf')] * (N + 10)
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] = mi... | def main():
N = int(eval(input()))
cand = [1]
dp = [float('inf')] * (N + 5)
tmp = 6
cnt = 1
while tmp**cnt <= N:
cand.append(tmp**cnt)
cnt += 1
tmp = 9
cnt = 1
while tmp**cnt <= N:
cand.append(tmp**cnt)
cnt += 1
cand.sort()
dp[0]... | p03329 |
N = int(eval(input()))
# DPだと思ったけど、2次元じゃなくて1次元だった
# けんちょんさん曰く、1次元でできないときに2次元で考える
sixes = [6 ** i for i in range(1, 7)]
nines = [9 ** i for i in range(1, 6)]
coin = [1] + sixes + nines
INF = 10**6
dp = [INF] * 100010
dp[0] = 0 # dp[i]:i円引き出すのに必要な回数
for money in range(1, N + 1):
dp_candidate = []
for ... | N = int(eval(input()))
sixes = [6 ** i for i in range(1, 7)]
nines = [9 ** i for i in range(1, 6)]
coin = [1] + sixes + nines
INF = 10**6
dp = [INF] * 100010
dp[0] = 0 # dp[i]:i円引き出すのに必要な回数
for money in range(1, N + 1):
dp[money] = min([dp[money-i] + 1 for i in coin if i <= money])
print((dp[N]))
| p03329 |
N = int(eval(input()))
A = [1, 6, 6**2, 6**3, 6**4, 6**5, 6**6, 9, 9**2, 9**3, 9**4, 9**5]
dp = [1000000] * 300000
dp[0] = 0
for i in range(N):
for a in A:
d = dp[i] + 1
dp[i + a] = min(dp[i + a], d)
print((dp[N])) | N = int(eval(input()))
INF = 10 ** 9
dp = [INF] * (N + 1)
dp[0] = 0
M = set()
M.add(1)
i = 1
while True:
if 6 ** i > N:
break
M.add(6 ** i)
i += 1
i = 1
while True:
if 9 ** i > N:
break
M.add(9 ** i)
i += 1
for i in range(N):
for m in M:
if i + m >... | p03329 |
n = int(eval(input()))
INF = 10**5
answer = INF
for i in range(n+1):
cost = i
ans = 0
for p in range(8):
ans += (cost // 6**p) % 6
cost = n-i
for q in range(7):
ans += (cost // 9**q) % 9
if answer > ans:
answer = ans
print(answer)
| n = int(eval(input()))
INF = 10**5
answer = INF
for i in range(n+1):
money = i
cnt = 0
while money > 0:
cnt += money % 6
money //= 6
money = n-i
while money > 0:
cnt += money % 9
money //= 9
if answer > cnt:
answer = cnt
print(answer) | p03329 |
N = int(eval(input()))
def main():
ans = N
for i in range(N + 1):
num = 0
cur = i
while 0 < cur:
num += cur % 6
cur //= 6
cur = N - i
while 0 < cur:
num += cur % 9
cur //= 9
if num < ans:
... | def f(num, base):
# calc max Pth Power
ret = 1
while ret <= num:
ret *= base
return ret // base
def main():
N = int(eval(input()))
st = {N}
ans = 0
while (all(st)):
st = {x - f(x, 6) for x in st} | {x - f(x, 9) for x in st}
ans += 1
print(ans)... | p03329 |
def f(num, base):
# calc max Pth Power
ret = 1
while ret <= num:
ret *= base
return ret // base
def main():
N = int(eval(input()))
st = {N}
ans = 0
while (all(st)):
st = {x - f(x, 6) for x in st} | {x - f(x, 9) for x in st}
ans += 1
print(ans)... | def f(num, base):
# calc max Pth Power
ret = 1
while ret <= num:
ret *= base
return ret // base
def main():
N = {int(eval(input()))}
ans = 0
while (all(N)):
N = {x - f(x, 6) for x in N} | {x - f(x, 9) for x in N}
ans += 1
print(ans)
return
... | p03329 |
from heapq import *
N = int(eval(input()))
result = 100000
ns = [1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049]
h = []
xs = {}
heappush(h, (0, 0))
while 1:
r, m = heappop(h)
if m == N:
result = r
break
for n in ns:
s = r + 1
x = m + n
... | N = int(eval(input()))
result = 100000000000
def calc(x, base):
r = 0
while x:
x, m = divmod(x, base)
r += m
return r
for i in range(N + 1):
result = min(result, calc(i, 6) + calc(N - i, 9))
print(result)
| p03329 |
N = int(eval(input()))
result = 100000000000
def calc(x, base):
r = 0
while x:
x, m = divmod(x, base)
r += m
return r
for i in range(N + 1):
result = min(result, calc(i, 6) + calc(N - i, 9))
print(result)
| N = int(eval(input()))
def calc(x, base):
r = 0
while x:
x, m = divmod(x, base)
r += m
return r
result = min(calc(i, 6) + calc(N - i, 9) for i in range(N + 1))
print(result)
| p03329 |
n = int(eval(input()))
dp = [i for i in range(101010)]
#dp[i] = i円払うのに必要な最小値
#6ˆn円,0<=i<=Nにおいて、dp[i+6ˆn] = min(dp[i+6ˆn] ,dp[i]+1)
#6の倍数
t = 10
while True:
for i in range(101010):
if 6**t+(i+1) < 101010:
dp[6**t+(i)] = min(dp[6**t+(i)], dp[i] + 1)
t -= 1
if t == 0:
... | n = int(eval(input()))
dp = [i for i in range(101010)]
#dp[i] = i円払うのに必要な最小値
#6ˆn円,0<=i<=Nにおいて、dp[i+6ˆn] = min(dp[i+6ˆn] ,dp[i]+1)
t = 7
while True:
for i in range(101010):
if 6**t+(i+1) < 101010:
dp[6**t+(i)] = min(dp[6**t+(i)], dp[i] + 1)
t -= 1
if t == 0:
... | p03329 |
n = int(eval(input()))
arr6 = []
for i in range(10):
arr6.append(6**i)
arr9 = []
for i in range(10):
arr9.append(9**i)
ans = float("inf")
for i in range(n+1):
count = 0
tmp = i
while tmp > 0:
t = 0
while arr6[t] <= tmp:
t+=1
tmp -= arr6[t-1... | N = int(eval(input()))
dp = [float("inf") for _ in range(100010)]
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
prin... | p03329 |
def main():
N = int(eval(input()))
dp = [-1]*(N + 1)
dp[0] = 0
multiples = [1]
n = 9
while n <= N:
multiples.append(n)
n *= 9
n = 6
while n <= N:
multiples.append(n)
n *= 6
multiples.sort(reverse=True)
# print(multiples)
for rati... | def main():
N = int(eval(input()))
ans = N
for i in range(N + 1):
cc = 0
t = i
while t > 0:
cc += t % 6
t //= 6
t = N - i
while t > 0:
cc += t % 9
t //= 9
ans = min(ans, cc)
print(ans)
if __n... | p03329 |
import bisect
x = int(eval(input()))
six_list = [6 ** i for i in range(7)]
nine_list = [9 ** i for i in range(6)]
def six_nine(n):
if n == 0:
return 0
else:
six = six_list[bisect.bisect_right(six_list, n) - 1]
nine = nine_list[bisect.bisect_right(nine_list, n) - 1]
... | import bisect
x = int(eval(input()))
six_list = [6 ** i for i in range(7)]
nine_list = [9 ** i for i in range(6)]
def six_nine(n):
if n < 6:
return n
else:
six = six_list[bisect.bisect_right(six_list, n) - 1]
nine = nine_list[bisect.bisect_right(nine_list, n) - 1]
... | p03329 |
import bisect
def six_nine(n):
if n < 6:
return n
else:
six = six_list[bisect.bisect_right(six_list, n) - 1]
nine = nine_list[bisect.bisect_right(nine_list, n) - 1]
return min(n // six + six_nine(n % six), 1 + six_nine(n - nine))
if __name__ == '__main__':
x ... | import bisect
six_list = [6 ** i for i in range(7)]
nine_list = [9 ** i for i in range(6)]
def six_nine(n):
if n < 6:
return n
else:
six = six_list[bisect.bisect_right(six_list, n) - 1]
nine = nine_list[bisect.bisect_right(nine_list, n) - 1]
return min(n // six + s... | p03329 |
import itertools
N = int(eval(input()))
base = [1]
for i in range(1, 7):
if 6 ** i <= N:
base.append(6 ** i)
for i in range(1, 6):
if 9 ** i <= N:
base.append(9 ** i)
ans = N
dp = [0] * (N + 1)
for i in range(1, N + 1):
dp[i] = min([dp[i - j] + 1 if i - j >= 0 else j for j in b... | N = int(eval(input()))
def base_n(x, n):
results = 0
while x > 0:
results += x % n
x //= n
return results
print((min([base_n(i, 6) + base_n(N - i, 9) for i in range(N + 1)]))) | p03329 |
import heapq
N=int(eval(input()))
N_max=100000
d=set()
n=1
while n<=N_max:
d.add(n)
n*=6
n=1
while n<=N_max:
d.add(n)
n*=9
dp=[N_max+1 for _ in range(N_max+1)]
dp[0]=0
for i in range(1,N_max+1):
for n in d:
if i>=n:
dp[i]=min(dp[i],dp[i-n]+1)
print((dp[N])... | N = int(eval(input()))
a = [1]
n6 = 6
while n6 <= 100000:
a.append(n6)
n6 *= 6
n9 = 9
while n9 <= 100000:
a.append(n9)
n9 *= 9
#dp[i]=ちょうどi円払う場合に最小の操作回数
dp = [10**9] * (N+100010)
dp[0] = 0
for i in range(N):
for n in a:
dp[i+n] = min(dp[i+n], dp[i]+1)
print((dp[N])) | p03329 |
def g(n, a):
for i in range(1, 100):
if a**i > n:
return a**(i-1)
return -1
def solve(n):
if n < 6:
return n
a = g(n, 6)
b = g(n, 9)
return min(solve(n-a)+1, solve(n-b)+1)
# assert solve(127) == 4
# assert solve(3) == 3
# assert solve(44852) == 16
... | def g(n, a):
for i in range(1, 100):
if a**i > n:
return a**(i-1)
return -1
dp = {}
def solve(n):
if n < 6:
return n
if not n in dp:
a = g(n, 6)
b = g(n, 9)
dp[n] = min(solve(n-a)+1, solve(n-b)+1)
return dp[n]
# assert solve(127) ... | 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 = [i for i in range(N+1)]
for i in L :
for j in range(i,(N+1)) :
dp[j] = min(dp[j-i]+1,dp[j])
ans = dp[N]
print(ans)
| N = int(eval(input()))
dp = [i for i in range(N+1)]
B6 = [6**i for i in range(1,8)]
B9 = [9**i for i in range(1,7)]
L = B6 + B9
L = sorted(list(set(L)))
for i in L :
for j in range(i, N+1) :
dp[j] = min(dp[j-i]+1, dp[j])
print((dp[-1]))
| p03329 |
N = int(eval(input()))
dp = [0 for i in range(N+1)]
dp[1] = 1
roku = 0
kyu = 0
for i in range(2, N+1):
if i == 6**(roku+1):
roku += 1
if i == 9**(kyu+1):
kyu += 1
kouho = [1]
for j in range(roku):
kouho.append(6**(j+1))
for j in range(kyu):
kouho.append(... | N = int(eval(input()))
dp = [0 for i in range(N+1)]
dp[1] = 1
kazu = [1]
i = 6
while i <= N:
kazu.append(i)
i*=6
i = 9
while i <= N:
kazu.append(i)
i*=9
kazu.sort()
kazulazor = len(kazu)
temp = [1]
lentemp = 1
index = 1
for i in range(2, N+1):
kouho = []
if index < kazulazor a... | p03329 |
#公式解法見て書いた
iN = int(eval(input()))
a6 = [0]*7
for i in range(7):
a6[i] = 6 ** i
a6.reverse()
a9 = [0]*6
for i in range(6):
a9[i] = 9 ** i
a9.reverse()
iAns = iN
for i in range(iN+1):
iD = iN - i
iC = 0
for j in range(7):
if i:
iG = a6[j]
if i >= i... | #公式解法見て書いた
iN = int(eval(input()))
a6 = [0]*7
for i in range(7):
a6[i] = 6 ** i
a6.reverse()
a9 = [0]*6
for i in range(6):
a9[i] = 9 ** i
a9.reverse()
iAns = iN
for i in range(iN+1):
iD = iN - i
iC = 0
for j in range(7):
if i:
iG = a6[j]
if i >= i... | p03329 |
import math
N=int(eval(input()))
number_of_withdrawal=[100000]
# def floor(float_number):
# integer = 0
# while integer < float_number:
# integer+=1
# if integer == float_number:
# return integer
# else:
# integer-=1
# return integer
for money_6 in range... | N=int(eval(input()))
money_list=[1,6,36,216,1296,7776,46656,9,81,729,6561,59049]
dp=[0]
for i in range(1,N+1):
dp.append(100000)
for i in range(N):
for money in money_list:
if i+money <= N:
dp[i+money]=min(dp[i+money],dp[i]+1)
print((dp[N])) | p03329 |
N=int(eval(input()))
money_list=[1,6,36,216,1296,7776,46656,9,81,729,6561,59049]
dp=[0]
for i in range(1,N+1):
dp.append(100000)
for i in range(N):
for money in money_list:
if i+money <= N:
dp[i+money]=min(dp[i+money],dp[i]+1)
print((dp[N])) | N=int(eval(input()))
money_list=[1,6,36,216,1296,7776,46656,9,81,729,6561,59049]
dp=[0]
for i in range(1,N+1):
dp.append(100000)
for i in range(1,N+1):
for money in money_list:
if i-money >= 0:
dp[i]=min(dp[i-money]+1,dp[i])
print((dp[N])) | p03329 |
N = int(eval(input()))
ans = 10**9+7
for i in range(N+1):
j = N-i
cnt = 0
while i > 0:
cnt += i%6
i //= 6
while j > 0:
cnt += j%9
j //= 9
ans = min(ans, cnt)
print(ans) | N = int(eval(input()))
sixs = [6**i for i in range(1,7)]
nines = [9**i for i in range(1,6)]
tmp = {}
def dfs(n):
if(n < 6):
return n
if(n in tmp):
return tmp[n]
m = 10**9+7
if(n >= 9):
max_nine = max(nine for nine in nines if nine <= n)
if(n%max_nine == 0):
m = min(m, ... | p03329 |
N = int(eval(input()))
sixs = [6**i for i in range(1,7)]
nines = [9**i for i in range(1,6)]
tmp = {}
def dfs(n):
if(n < 6):
return n
if(n in tmp):
return tmp[n]
m = 10**9+7
if(n >= 9):
max_nine = max(nine for nine in nines if nine <= n)
if(n%max_nine == 0):
m = min(m, ... | N = int(eval(input()))
nine = [9**i for i in range(7, 0, -1)]
six = [6**i for i in range(8, 0, -1)]
tmp = {}
def f(n):
if(n < 6):
return n
if(n in tmp):
return tmp[n]
m = 1e9+7
if(n >= 9):
mn = max(x for x in nine if x <= n)
if(n%mn == 0):
m = min(m, n//mn)
else:
... | p03329 |
N = int(eval(input()))
ans = 1e9
for i in range(N+1):
cnt = 0
tmp = i
while tmp > 0:
cnt += tmp%6
tmp //= 6
tmp = N-i
while tmp > 0:
cnt += tmp%9
tmp //= 9
ans = min(ans, cnt)
print(ans) | from itertools import count, takewhile
N = int(eval(input()))
def dfs(n, d={}):
if(n < 6):
return n
if(n in d):
return d[n]
mn = max(takewhile(lambda x: x<=n, (9**i for i in count())))
ms = max(takewhile(lambda x: x<=n, (6**i for i in count())))
d[n] = min(dfs(n-mn), dfs(n-ms))+1
return ... | p03329 |
N = int(eval(input()))
dp = dict()
dp[0] = 0
# 貰う DP --- dp[n] に遷移を集める
for n in range(1, N+1):
dp[n] = dp[n-1] + 1
# メモ化
x = 6
while x <= n:
dp[n] = min(dp[n], dp[n-x]+1)
x *= 6
x = 9
while x <= n:
dp[n] = min(dp[n], dp[n-x]+1)
x *= 9
# dp[n] = ans
print... | n = int(eval(input()))
max_N = 1000000
memo = [False]*max_N
import sys
import threading
sys.setrecursionlimit(100000)
threading.stack_size(128*1024*1024)
# 貰う DPではなく、再帰を使ったメモ化再帰
from functools import lru_cache
lru_cache(maxsize=100000)
def f(n):
if n < 6:
return n
if memo[n]:
# print(f"at n:... | p03329 |
N = int(eval(input()))
memo = [N]*(N+1)
unit = [1]
for b in [6,9]:
u = b
while u <= N:
unit.append(u)
u *= b
unit.sort()
cur = set({0})
for i in range(1,N+1):
prev = cur
cur = set()
for p in prev:
for u in unit:
c = p + u
if c == N:
... | from bisect import bisect_right
N = int(eval(input()))
unit = [1]
for b in [6,9]:
u = b
while u <= N:
unit.append(u)
u *= b
unit.sort()
Nu = len(unit)
ans = N
state_pool = [(0, 0, Nu-1)]
while state_pool:
n, i, pk = state_pool.pop()
if N - n >= (ans-i)*unit[pk]:
... | p03329 |
n=int(eval(input()))
dp=[float("INF")]*(n+1)
dp[0]=0
temp=6
cnt=0
while temp<=n:
cnt+=1
dp[temp]=1
temp*=6
l=[0,0]
l[0]=cnt
temp=9
cnt=0
while temp<=n:
cnt+=1
dp[temp]=1
temp*=9
l[1]=cnt
for j,v in zip(l,[6,9]):
for i in range(j+1):
h=pow(v,i)
for d in range(h,n+1):
dp[... | n=int(eval(input()))
ans=float("INF")
for i in range(n+1):
d=0
temp=i
while (temp>0):
d+=temp%6
temp//=6
temp=n-i
while(temp>0):
d+=temp%9
temp//=9
ans=min(d,ans)
print(ans) | p03329 |
N = int(eval(input()))
dp = [N]*(N+1)
dp[0] = 0
for i in range(N+1):
for j in [6**i for i in range(7)]:
if i+j <= N:
dp[i+j] = min(dp[i+j],dp[i]+1)
for j in [9**i for i in range(6)]:
if i+j <= N:
dp[i+j] = min(dp[i+j],dp[i]+1)
print((dp[-1])) | N = int(eval(input()))
dp = [N]*(N+1)
dp[0] = 0
for i in range(N+1):
for j in [6**i for i in range(7)]:
if i+j <= N:
dp[i+j] = min(dp[i+j],dp[i]+1)
for j in [9**i for i in range(1,6)]:
if i+j <= N:
dp[i+j] = min(dp[i+j],dp[i]+1)
print((dp[-1])) | p03329 |
n=int(eval(input()))
inf=float("inf")
DP=[inf]*(n+1)
DP[0]=0
for i in range(1,n+1):
DP[i]=DP[i-1]+1
for point in (6,9):
cnt=1
while point**cnt<=i:
DP[i]=min(DP[i-1]+1,DP[i-point**cnt]+1,DP[i])
cnt +=1
print((DP[n])) | n=int(eval(input()))
inf=float("inf")
DP=[inf]*(n+1)
DP[0]=0
for i in range(1,n+1):
DP[i]=DP[i-1]+1
for P in (6,9):
cnt=1
while P**cnt<=i:
DP[i]=min(DP[i-1]+1,DP[i-P**cnt]+1,DP[i])
cnt +=1
print((DP[n])) | p03329 |
n=int(eval(input()))
inf=float("inf")
DP=[inf]*(n+1)
DP[0]=0
for i in range(1,n+1):
DP[i]=DP[i-1]+1
for P in (6,9):
cnt=1
while P**cnt<=i:
DP[i]=min(DP[i-1]+1,DP[i-P**cnt]+1,DP[i])
cnt +=1
print((DP[n])) | inf=float("inf")
n=int(eval(input()))
DP=[inf]*(n+1)
DP[0]=0
for i in range(1,n+1):
DP[i]=DP[i-1]+1
for num in (6,9):
cnt=1
while num**cnt<=i:
DP[i]=min(DP[i],DP[i-num**cnt]+1)
cnt +=1
print((DP[n])) | p03329 |
n=int(eval(input()))
s_6=[6**(6-i) for i in range(6)]
s_9=[9**(5-i) for i in range(5)]
amari=[0,1,2,3,4,5,1,2,3,1,2,3,2,3]
best=float("inf")
for i in range(n+1):
count_6=0
n_6=i
for j in range(len(s_6)):
count_6+=n_6//s_6[j]
n_6=n_6%s_6[j]
n_9=n-i
count_9=0
fo... | n = int(eval(input()))
ans = float("inf")
for n_nine in range(0, n//9 + 1):
s = n - 9 * n_nine
n_six = s // 6
n_one = s - 6 * n_six
n_nine2 = 0
n_six2 = 0
pow_nine = 5
pow_six = 6
while n_nine >= 9:
if n_nine >= 9 ** (pow_nine - 1):
n_nine -= 9 ** (p... | p03329 |
n = int(eval(input()))
ans = float("inf")
for n_nine in range(0, n//9 + 1):
s = n - 9 * n_nine
n_six = s // 6
n_one = s - 6 * n_six
n_nine2 = 0
n_six2 = 0
pow_nine = 5
pow_six = 6
while n_nine >= 9:
if n_nine >= 9 ** (pow_nine - 1):
n_nine -= 9 ** (p... | def counting(num, power, base):
num2 = 0
while num >= base:
if num >= base ** (power - 1):
num -= base ** (power - 1)
num2 += 1
else:
power -= 1
return num + num2
def main():
n = int(eval(input()))
ans = float("inf")
for n_nine in... | p03329 |
s=eval(input())
a=int(s)
list=[]
list.append(1)
list.append(6)
list.append(9)
list.append(36)
list.append(81)
list.append(216)
list.append(729)
list.append(1296)
list.append(6561)
list.append(7776)
list.append(59049)
list.append(46656)
pp=[50 for l in range(50)]
def money(x,y):
for i in range(12):
... | s=eval(input())
a=int(s)
list=[]
list.append(1)
list.append(6)
list.append(9)
list.append(36)
list.append(81)
list.append(216)
list.append(729)
list.append(1296)
list.append(6561)
list.append(7776)
list.append(59049)
list.append(46656)
pp=[]
def money(x,y):
for i in range(12):
b=x//list[i]
... | p03329 |
N = int(eval(input()))
dp = [0]*100001
L = [1,6,36,216,1296,7776,46656,9,81,729,6561,59049]
for i in range(100001):
for j in range(len(L)):
if 1 <= i+L[j] <= 100000:
if dp[i+L[j]] == 0:
dp[i+L[j]] = dp[i]+1
else:
dp[i+L[j]] = min(dp[i]+1,dp[i+... | N = int(eval(input()))
dp = [float('inf')]*100001
dp[0],dp[1] = 0,1
L = [1,6,36,216,1296,7776,46656,9,81,729,6561,59049]
for i in range(2,100001):
for j in range(len(L)):
if i-L[j] >= 0:
dp[i] = min(dp[i-L[j]]+1,dp[i])
print((dp[N])) | p03329 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = []
i = 1
while True:
if 6**i <= 100000:
A.append(6**i)
i += 1
else:
break
A.sort(reverse=True)
B = []
i = 1
while True:
if 9**i... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = []
i = 1
while True:
if 6**i <= 100000:
A.append(6**i)
i += 1
else:
break
A.sort(reverse=True)
B = []
i = 1
while True:
if 9**i... | p03329 |
# dp
# N円を作るのに最も小さい操作回数
import sys
readline = sys.stdin.readline
N = int(readline())
dp = [i for i in range(N + 1)]
for i in range(len(dp)):
n = 6
while i + n < len(dp):
if dp[i + n] > dp[i] + 1:
dp[i + n] = dp[i] + 1
n *= 6
n = 9
while i + n < len(dp):
if dp[i + n] > dp[... | import sys
readline = sys.stdin.readline
N = int(readline())
INF = 10 ** 10
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(10,0,-1):
for j in range(N + 1):
if dp[j] != INF:
if j + 6 ** i <= N:
dp[j + 6 ** i] = min(dp[j + 6 ** i], dp[j] + 1)
if j + 9 ** i <= N:
dp[j + 9 *... | p03329 |
N=int(eval(input()))
l=[1,6,9,36,81,216,729,1296,6561,7776,46656,59049]
l2=[0]*100010
for i in range(1,100010):
mn=100000000000000000
for x in l:
if i-x>=0 and l2[i-x]<mn:
mn=l2[i-x]+1
l2[i]=mn
print((l2[N])) | N=int(eval(input()))
l=[1,6,9,36,81,216,729,1296,6561,7776,46656,59049]
l2=[0]*100001
for i in range(1,100001):
mn=100000000000000000
for x in l:
if i-x>=0 and l2[i-x]<mn:
mn=l2[i-x]+1
l2[i]=mn
print((l2[N])) | p03329 |
N=int(eval(input()))
l=[1,6,9,36,81,216,729,1296,6561,7776,46656,59049]
l2=[0]*100001
for i in range(1,100001):
mn=100000000000000000
for x in l:
if i-x>=0 and l2[i-x]<mn:
mn=l2[i-x]+1
l2[i]=mn
print((l2[N])) | l=[1,6,9,36,81,216,729,1296,6561,7776,46656,59049]
l2=[0]*100001
N=int(eval(input()))
for i in range(1,N+1):
mn=100000000000000000
for x in l:
if i-x>=0 and l2[i-x]<mn:
mn=l2[i-x]+1
l2[i]=mn
print((l2[N])) | p03329 |
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():
N = int(readline())
amt = [1]
a = 6
while a <= N:
amt.append(a)
a *= 6
a = 9
while a <= ... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def f(n, a):
ans = 0
while n > 0:
ans += n % a
n //= a
return ans
def main():
N = int(readline())
an... | p03329 |
import sys
readline = sys.stdin.readline
from math import floor, log
def main():
N = int(readline())
dp = [i for i in range(N+1)]
for i in range(N):
dp[i+1] = min(dp[i+1], dp[i]+1)
log9 = floor(log(N-i, 9))
for e in range(1, log9+2):
if i + 9**e <= N:
... | import sys
readline = sys.stdin.readline
def main():
N = int(readline())
dp = [i for i in range(N+1)]
for i in range(N):
dp[i+1] = min(dp[i+1], dp[i]+1)
e = 9
while i + e <= N:
dp[i+e] = min(dp[i+e], dp[i]+1)
e *= 9
e = 6
while ... | p03329 |
n=int(eval(input()))
dp=[0]*(n+1)
for i in range(1,n+1):
ans=dp[i-1]+1
j=1
while i>=6**j:
ans=min(ans,dp[i-6**j]+1)
j+=1
j=1
while i>=9**j:
ans=min(ans,dp[i-9**j]+1)
j+=1
dp[i]=ans
print(ans)
| n=int(eval(input()))
l=[1]
l_9=[pow(9,i) for i in range(1,7)]
l_6=[pow(6,i) for i in range(1,8)]
l+=l_9
l+=l_6
l.sort(reverse=True)
dp=[10**9 for i in range(n+1)]
dp[0]=0
for i in range(1,n+1):
for j in l:
if i-j>=0:
dp[i]=min(dp[i],dp[i-j]+1)
print((dp[n])) | p03329 |
n=int(eval(input()))
l=[1]
l_9=[pow(9,i) for i in range(1,7)]
l_6=[pow(6,i) for i in range(1,8)]
l+=l_9
l+=l_6
l.sort(reverse=True)
dp=[10**9 for i in range(n+1)]
dp[0]=0
for i in range(1,n+1):
for j in l:
if i-j>=0:
dp[i]=min(dp[i],dp[i-j]+1)
print((dp[n])) | n=int(eval(input()))
m=[int(pow(6,i)) for i in range(7)]
m9=[int(pow(9,i)) for i in range(1,6)]
m+=m9
m.sort(reverse=True)
# print(m)
dp=[10**18 for i in range(n+1)]
dp[0]=0
for i in range(1,n+1):
for j in m:
if i-j>=0:
dp[i]=min(dp[i],dp[i-j]+1)
# print(dp)
print((dp[n])) | p03329 |
N = int(eval(input()))
INF = 10 ** 6
dp = [INF] * (10**5+1)
dp[0] = 0
for n in range(1, 100001):
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(... | N = int(eval(input()))
INF = 10 ** 5 + 1
dp = [0 for _ in range(INF)]
for n in range(1, N + 1):
dp[n] = 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)
... | p03329 |
# 配るDP
N = int(eval(input()))
INF = 10 ** 5 + 1
dp = [INF for _ in range(N + 1)]
dp[0] = 0
for n in range(N):
power = 1
while n + power <= N:
dp[n + power] = min(dp[n + power], dp[n] + 1)
power *= 6
power = 1
while n + power <= N:
dp[n + power] = min(dp[n + po... | # 貰うDP
N = int(eval(input()))
INF = 10 ** 5 + 1
dp = [INF for _ in range(N + 1)]
dp[0] = 0
for n in range(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)
... | p03329 |
# 貰うDP
N = int(eval(input()))
INF = 10 ** 5 + 1
dp = [INF for _ in range(N + 1)]
dp[0] = 0
for n in range(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)
... | INF = float('inf')
N = int(eval(input()))
dp = [INF for _ in range(N+1)]
dp[0] = 0
for i in range(1, N+1):
# 1円玉を使う場合
dp[i] = min(dp[i], dp[i-1] + 1)
# 6べき円玉を使う場合
power = 6
while power <= i:
dp[i] = min(dp[i], dp[i-power] + 1)
power *= 6
# 9べき円玉を使う場合
power = ... | p03329 |
N = int(eval(input()))
INF = float('inf')
dp = [INF] * (N+1)
dp[0] = 0
for n in range(N + 1):
power = 0
while pow(6, power) <= N:
dp[n] = min(dp[n], dp[n - pow(6, power)] + 1)
power += 1
power = 0
while pow(9, power) <= N:
dp[n] = min(dp[n], dp[n - pow(9, power)] +... | N = int(eval(input()))
INF = float('inf')
dp = [INF] * (N+1)
dp[0] = 0
for n in range(N + 1):
power = 0
while pow(6, power) <= n:
dp[n] = min(dp[n], dp[n - pow(6, power)] + 1)
power += 1
power = 0
while pow(9, power) <= n:
dp[n] = min(dp[n], dp[n - pow(9, power)] +... | p03329 |
n = int(eval(input()))
ans = 10 ** 5
for i in range(n + 1):
count = 0
s = i
while s > 0:
count += s % 6
s //= 6
t = n - i
while t > 0:
count += t % 9
t //= 9
ans = min(count, ans)
print(ans) | n = int(eval(input()))
ans = 1000000
for i in range(n+1):
count = 0
s = i
while s > 0:
count += s % 6
s //= 6
t = n - i
while t > 0:
count += t % 9
t //= 9
ans = min(ans, count)
print(ans) | p03329 |
N = int(eval(input()))
dp = [N + 1 for i in range(N+1)]
dp[0] = 0
for i in range(1,N+1):
j = 0
while i - pow(6,j) >= 0:
if dp[i-pow(6,j)] + 1 < dp[i]:
dp[i] = dp[i-pow(6,j)] + 1
j += 1
j = 0
while i - pow(9,j) >= 0:
if dp[i-pow(9,j)] + 1 < dp[i]:
... | inf = float('inf')
N = int(eval(input()))
dp = [inf] * (N+1)
dp[0] = 0
for i in range(N):
if i+1 < N+1:
dp[i+1] = min(dp[i+1], dp[i] + 1)
j = 6
while i+j < N+1:
dp[i+j] = min(dp[i+j], dp[i] + 1)
j *= 6
j = 9
while i+j < N+1:
dp[i+j] = min(dp[i+j], d... | p03329 |
from collections import deque
N=int(eval(input()))
A=[]
for i in range(N):
s=int(eval(input()))
A.append(s)
A.sort()
H=deque()
H.append(A[0])
s=1
t=N-1
i=0
while t-s!=-1:
x=A[s]
y=A[t]
a=abs(H[0]-x)
b=abs(H[-1]-x)
c=abs(H[0]-y)
d=abs(H[-1]-y)
e=max(a,b,c,d)
if... | import sys
N=int(eval(input()))
A=[int(eval(input())) for i in range(N)]
B=sorted(A)
if N%2==0:
C=B[:(N//2)]
D=B[(N//2):]
print((2*sum(D)-2*sum(C)+C[-1]-D[0]))
sys.exit()
C=B[:(N//2)]
D=B[((N//2)+1):]
s=B[(N//2)]
print((max(2*sum(D)-2*sum(C)+C[-1]-s,2*sum(D)-2*sum(C)+s-D[0]))) | p03223 |
from collections import deque
N = int(eval(input()))
A = deque(sorted([int(eval(input())) for i in range(N)]))
X = deque([A.popleft()])
ans = 0
for i in range(N - 1):
# Aのどちらから取り出してXのどちらに入れるか
left_left = abs(X[0] - A[0])
left_right = abs(X[-1] - A[0])
right_left = abs(X[0] - A[-1])
right... | N = int(eval(input()))
A = sorted([int(eval(input())) for i in range(N)])
if N % 2 == 0:
X = [-2] * ((N - 2) // 2) + [-1, 1] + [2] * ((N - 2) // 2)
ans = sum([a * x for a, x in zip(A, X)])
print(ans)
else:
X1 = [-2] * ((N - 2) // 2 + 1) + [1, 1] + [2] * ((N - 2) // 2)
X2 = [-2] * ((N - 2) ... | p03223 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.r... | p03223 |
# coding: utf-8
# Your code here!
n=int(eval(input()))
a=[]
for _ in range(n):
a.append(int(eval(input())))
a.sort()
#print(a)
ans=0
if n%2==0:
for i in range(n//2-1):
ans += 2*(a[n-1-i]-a[i])
ans += a[n//2] - a[n//2-1]
if n%2==1:
for i in range(n//2-1):
... | # coding: utf-8
# Your code here!
n=int(eval(input()))
a=[]
for _ in range(n):
a.append(int(eval(input())))
a.sort()
#print(a)
ans=0
if n%2==0:
for i in range(n//2-1):
ans += 2*(a[n-1-i]-a[i])
ans += a[n//2] - a[n//2-1]
if n%2==1:
for i in range(n//2-1):
... | p03223 |
N = int(eval(input()))
A = []
for i in range(N):
A.append(int(eval(input())))
A.sort()
ary1 = [A[0]]
ary2 = [A[N-1]]
fst = 0
lst = N
fst_flg = False
sum1, sum2 = 0,0
while fst + 1 < lst:
if fst_flg:
fst_flg = False
if fst + 2 != lst:
fst += 1
ary1 = [A[fst]] + ary1 + [A[fst+1]]
ary2 = [A... | N = int(eval(input()))
A = []
for i in range(N):
A.append(int(eval(input())))
A.sort()
if N % 2 == 0:
print((-2*sum(A[:N//2-1]) + 2*(sum(A[N//2+1:])) + A[N//2] - A[N//2-1]))
exit()
a = 2*sum(A[N//2+1:]) - 2*sum(A[:N//2-1]) - A[N//2] - A[N//2-1]
b = 2*sum(A[N//2+2:]) - 2*sum(A[:N//2]) + A[N//2] + A[N//2+1]... | p03223 |
# 頂点 v の所属するグループを調べる
def root(v, uni):
if uni[v] < 0: # v が親の場合
return v
else: # v が子の場合
uni[v] = root(uni[v], uni) # 親のrootを調べる
return uni[v]
# 頂点 a と頂点 b をつなぐ。もともと同じグループのとき、False を返す
def connect(a, b, uni, sets):
# まずはそれぞれ根の番号に置き換える
ra = root(a, uni)
rb = root(b, uni)
... | # 頂点 v の所属するグループを調べる
def root(v, uni):
if uni[v] < 0: # v が親の場合
return v
else: # v が子の場合
uni[v] = root(uni[v], uni) # 親のrootを調べる
return uni[v]
# 頂点 a と頂点 b をつなぐ。もともと同じグループのとき、False を返す
def connect(a, b, uni, sets):
# まずはそれぞれ根の番号に置き換える
ra = root(a, uni)
rb = root(b, uni)
... | p03857 |
n, k, l = list(map(int, input().split()))
def root(x):
if x == parent[x]: return x
parent[x] = root(parent[x])
return parent[x]
def unite(x, y):
px = root(x)
py = root(y)
if px < py:
parent[py] = px
else:
parent[px] = py
parent = list(range(n))
for i in range... | n, k, l = list(map(int, input().split()))
def root(x):
if x != parent[x]: parent[x] = x = root(parent[x])
return x
def unite(x, y):
px = root(x)
py = root(y)
if px < py:
parent[py] = px
else:
parent[px] = py
parent = list(range(n))
for i in range(k):
p, q = l... | p03857 |
import sys
from collections import deque
sys.setrecursionlimit(1000000)
N, K, L = list(map(int, input().split()))
pq = [list(map(int, input().split())) for _ in range(K)]
rs = [list(map(int, input().split())) for _ in range(L)]
G_r = [[] for _ in range(N+1)]
for elem in pq:
G_r[elem[0]].append(elem[1])
... | import sys
from collections import deque, Counter
sys.setrecursionlimit(1000000)
N, K, L = list(map(int, input().split()))
pq = [list(map(int, input().split())) for _ in range(K)]
rs = [list(map(int, input().split())) for _ in range(L)]
G_r = [[] for _ in range(N+1)]
for elem in pq:
G_r[elem[0]].append(el... | p03857 |
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
class UnionFind:
def __init__(self, size):
self.parent = [i for i in range(size)]
self.rank = [0 for _ in range(size)]
def find(self, x):
if self.parent[x] == x:
... | # python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
class UnionFind:
def __init__(self, size):
self.parent = [i for i in range(size)]
self.rank = [0 for _ in range(size)]
def find(self, x):
if self.parent[x] == x:
... | p03857 |
from collections import defaultdict as dd
road = dd(list)
train = dd(list)
rd = dict()
td = dict()
ans = []
def gr(tree,start):
island = set()
rest = [start,]
while rest:
node = rest.pop()
island.add(node)
for x in tree[node]:
if x not in island:
... | from collections import defaultdict as dd
def find(u,x):
if u[x]<0:
return x
u[x] = find(u,u[x])
return u[x]
def unite(u,a,b):
a = find(u,a)
b = find(u,b)
if a == b:
return False
if u[b] < u[a]:
a,b = b,a
u[a] += u[b]
u[b] = a
return True
... | p03857 |
import queue
N,K,L=list(map(int,input().split()))
G=[[] for i in range(N)]
H=[[] for i in range(N)]
#T=[-1 for i in range(N)]
#B=[-1 for i in range(N)]
for i in range(K):
p,q=list(map(int,input().split()))
G[p-1].append(q-1)
G[q-1].append(p-1)
for i in range(L):
r,s=list(map(int,input().split... | N,K,L=list(map(int,input().split()))
G=[[] for i in range(N)]
H=[[] for i in range(N)]
#T=[-1 for i in range(N)]
#B=[-1 for i in range(N)]
for i in range(K):
p,q=list(map(int,input().split()))
G[p-1].append(q-1)
G[q-1].append(p-1)
for i in range(L):
r,s=list(map(int,input().split()))
H[r-... | p03857 |
N,K,L = list(map(int, input().split()))
class UFT:
def __init__(self, N):
self.UFdata = [-1] * (N+1)
self.rank = [0] * (N+1)
self.connected_num = [1] * (N+1)
def find(self,x):
UFdata = self.UFdata
while UFdata[x] != -1:
x = UFdata[x]
... | N,K,L = list(map(int, input().split()))
class UFT:
def __init__(self, N):
self.UFdata = [-1] * (N+1)
self.rank = [0] * (N+1)
self.connected_num = [1] * (N+1)
def find(self,x):
UFdata = self.UFdata
while UFdata[x] != -1:
x = UFdata[x]
... | p03857 |
N,K,L = list(map(int, input().split()))
class UFT:
def __init__(self, N):
self.UFdata = [-1] * (N+1)
self.rank = [0] * (N+1)
self.connected_num = [1] * (N+1)
def find(self,x):
UFdata = self.UFdata
while UFdata[x] != -1:
x = UFdata[x]
... | N,K,L = list(map(int, input().split()))
class UFT:
def __init__(self, N):
self.UFdata = [-1] * (N+1)
self.rank = [0] * (N+1)
self.connected_num = [1] * (N+1)
def find(self,x):
UFdata = self.UFdata
while UFdata[x] != -1:
x = UFdata[x]
... | p03857 |
N,K,L = list(map(int, input().split()))
class UFT:
def __init__(self, N):
self.UFdata = [-1] * (N+1)
self.rank = [0] * (N+1)
def find(self,x):
UFdata = self.UFdata
while UFdata[x] != -1:
x = UFdata[x]
return x
def unite(self,x,y):
... | N,K,L = list(map(int, input().split()))
class UFT:
def __init__(self, N):
self.UFdata = [-1] * (N+1)
self.rank = [0] * (N+1)
def find(self,x):
UFdata = self.UFdata
while UFdata[x] != -1:
x = UFdata[x]
return x
def unite(self,x,y):
... | p03857 |
N,K,L = list(map(int, input().split()))
class UFT:
def __init__(self, N):
self.UFdata = [-1] * (N+1)
self.rank = [0] * (N+1)
def find(self,x):
UFdata = self.UFdata
while UFdata[x] != -1:
x = UFdata[x]
return x
def unite(self,x,y):
... | N,K,L = list(map(int, input().split()))
class UFT:
def __init__(self, N):
self.UFdata = [-1] * (N+1)
self.rank = [0] * (N+1)
def find(self,x):
UFdata = self.UFdata
while UFdata[x] != -1:
x = UFdata[x]
return x
def unite(self,x,y):
... | p03857 |
class Union():
def __init__(me,N):
me.N = N
me.up = [-1]*N
me.down = [ [] for i in range(N) ]
def union(me,a,b):
ua = me.up[a] if me.up[a]!=-1 else a
ub = me.up[b] if me.up[b]!=-1 else b
if (ua == ub):
return
if ( len(me.down[ua]) < len(me.down[ub]) ):
ub,ua = ua,u... | class Union():
def __init__(me,N):
me.N = N
me.up = [-1]*N
me.down = [ [] for i in range(N) ]
def union(me,a,b):
ua = me.up[a] if me.up[a]!=-1 else a
ub = me.up[b] if me.up[b]!=-1 else b
if (ua == ub):
return
if ( len(me.down[ua]) < len(me.down[ub]) ):
ub,ua = ua,u... | p03857 |
from collections import defaultdict
N, K, L = map(int, input().split())
class UnionFind(object):
def __init__(self, n):
self.n = n
self.par = list(range(n))
self.rank = [1] * n
def is_same(self, a, b):
return self.root(a) == self.root(b)
def root(self, x)... | from collections import defaultdict
N, K, L = map(int, input().split())
class UnionFind(object):
def __init__(self, n):
self.n = n
self.par = list(range(n))
self.rank = [1] * n
def is_same(self, a, b):
return self.root(a) == self.root(b)
def root(self, x)... | p03857 |
def main():
h, w, k = list(map(int, input().split()))
s = [input().rstrip() for _ in range(h)]
t = [[0]*(w+1) for _ in range(h+1)]
for i in range(h):
for j in range(w):
if s[i][j] == "1":
t[i+1][j+1] = 1
for i in range(1, h+1):
for j in range(1, w... | def main():
h, w, k = list(map(int, input().split()))
s = [input().rstrip() for _ in range(h)]
t = [[0]*(w+1) for _ in range(h+1)]
for i in range(h):
for j in range(w):
if s[i][j] == "1":
t[i+1][j+1] = 1
for i in range(1, h+1):
for j in range(1, w... | p02733 |
from sys import stdin
def main():
#入力
last_res=float("inf")
readline=stdin.readline
H,W,K=list(map(int,readline().split()))
grid=[]
for i in range(H):
s=readline().strip()
grid.append(s)
for i in range(1<<(H-1)):
output=[]
for j in range(H-1):
... | from sys import stdin
def main():
#入力
readline=stdin.readline
h,w,k=list(map(int,readline().split()))
grid=[readline().strip() for _ in range(h)]
ans=float("inf")
for i in range(1<<(h-1)):
div=[(i>>j)&1 for j in range(h-1)]
l=len([0 for i in range(h-1) if div[i]])+1
... | p02733 |
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
H, W, K = [int(x) for x in input().split()]
S = [list(input().strip()) for _ in range(H)]
ans = float("inf")
for n in range(2 ** (H - 1)):
tmp = 0
wn = [0] * 10
wi = [set() for ... | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
H, W, K = [int(x) for x in input().split()]
S = [list(input().strip()) for _ in range(H)]
ans = float("inf")
for n in range(2 ** (H - 1)):
tmp = 0
wn = [0] * 10
wi = [set() for ... | p02733 |
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
H, W, K = [int(x) for x in input().split()]
S = [list(input().strip()) for _ in range(H)]
ans = float("inf")
for n in range(2 ** (H - 1)):
tmp = 0
wn = [0] * 10
wi = [set() for ... | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
H, W, K = [int(x) for x in input().split()]
S = [list(input().strip()) for _ in range(H)]
ans = float("inf")
for n in range(2 ** (H - 1)):
tmp = 0
wn = [0] * 10
for i in range... | p02733 |
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, m, K = na()
b = []
for i in range(n):
b.append(ns())
ans = 999999999999999
for ptn in range(1<<m-1):
lans = 0
x = ... | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, m, K = na()
b = []
for i in range(n):
b.append(ns())
ans = 999999999999999
for ptn in range(1<<n-1):
lans = 0
x = ... | p02733 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
... | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
... | p02733 |
r=range;_,*s=open(0)
h,w,k=list(map(int,_.split()))
m=9e9
for i in r(1<<h-1):
t,v,l=[],-1,1
for j in r(h):
if i>>j&1:t+=j+1,;l+=1
t+=h,
c=[0]*l
for i in r(w):
b=f=g=0;u=[]
for j in r(l):d,b=sum(s[j][i]>"0"for j in r(b,t[j])),t[j];u+=d,;g|=d>k;c[j]+=d;f|=c[j]>k
v+=f
if f:c=u
... | r=range;_,*s=open(0)
h,w,k=list(map(int,_.split()))
m=9e9
for i in r(1<<h-1):
t,v,l=[],-1,1
for j in r(h):
if i>>j&1:t+=j+1,;l+=1
t+=h,
c=[0]*l
for i in r(w):
b=f=g=0;u=[]
for j in r(l):d,b=sum(s[j][i]>"0"for j in r(b,t[j])),t[j];u+=d,;g|=d>k;c[j]+=d;f|=c[j]>k
v+=f
if f:c=u
if not g:m=min(... | p02733 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
from re import split
import sys
import string
from bisect import bisect_left, bisect_r... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
from re import split
import sys
import string
from bisect import bisect_left, bisect_r... | p02733 |
import sys
input = sys.stdin.readline
H, W, K = list(map(int, input().split()))
S = [[int(i) for i in input()[:-1]] for _ in range(H)]
m = float('inf')
for i in range(1 << (H - 1)) :
pos = [0] * H
x = 0
for j in range(H - 1) :
if i & (1 << j) :
x += 1
pos[j+1] = x
x = 0
... | import sys
input = sys.stdin.readline
H, W, K = list(map(int, input().split()))
S = [[int(i) for i in input()[:-1]] for _ in range(H)]
m = float('inf')
for i in range(1 << (H - 1)) :
pos = [0] * H
x = 0
for j in range(H - 1) :
if i & (1 << j) :
x += 1
pos[j+1] = x
ret = x
x ... | p02733 |
x,*s=open(0)
h,w,k,*m=list(map(int,x.split()))
for b in range(512):
r=t=j=0;d=[0]*h
while j<w:
i=c=0
while h-i:
d[c]+=s[i][j]>'0';x=d[c]>k
if(t<j)&x:r+=1;t=j;d=[0]*h;break
r+=x*h*w;c+=b>>i&1;i+=1
else:j+=1
while b:r+=b&1;b>>=1
m+=r,
print((min(m))) | x,*s=open(0)
h,w,k,*m=list(map(int,x.split()))
b=512
while b:
b-=1;r=t=j=0;d=[0]*h
while j<w:
i=c=0
while h-i:
d[c]+=s[i][j]>'0';y=t<j
if d[c]>k:d=[0]*h;r+=1-~-y*h*w;t=j;j-=y;break
c+=b>>i&1;i+=1
j+=1
m+=r+c,
print((min(m))) | p02733 |
import sys
input = sys.stdin.readline
H, W, K = list(map(int, input().split()))
choco = []
for i in range(H):
s = input().strip()
a = list(map(int, list(s)))
choco.append(a)
def f(n):
if n == 1:
return [[0], [1]]
a = f(n-1)
na = []
for v in a:
na.append([0] + v)
na.append([1... | import sys, itertools
input = sys.stdin.readline
H, W, K = list(map(int, input().split()))
choco = []
for i in range(H):
s = input().strip()
a = list(map(int, list(s)))
choco.append(a)
def min_split(h):
sum_cnt = [0] * H
num_split = 0
for j in range(W):
c = 0
cnt = [0] * H
flag... | p02733 |
import sys
from itertools import accumulate
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W, K = lr()
S = [list(map(int, sr())) for _ in range(H)]
Scum = [list(accumulate(x)) for x in S]
answer = 10000
for bit in range(1<<(H-1)):
count =... | # coding: utf-8
import sys
from itertools import accumulate
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W, K = lr()
S = [list(map(int, sr())) for _ in range(H)]
Scum = [list(accumulate(row)) for row in S]
# H方向はbit全探索、W方向はGreedyに
INF = 10 ... | p02733 |
import sys
input = sys.stdin.readline
h, w, K = [int(x) for x in input().split()]
s = [input().rstrip() for _ in range(h)]
# print(s)
# print(len(s[1]))
# ans = h + w - 2
ans = h + w - 2
for i in range(2 ** (h - 1)):
new_s = []
cnt = 0
i_bin = bin(i)[2:].zfill(h - 1)
add = []
for j ... | import sys
input = sys.stdin.readline
h, w, K = [int(x) for x in input().split()]
s = [input().rstrip() for _ in range(h)]
ans = h + w - 2
for i in range(2 ** (h - 1)):
new_s = []
cnt = 0
i_bin = bin(i)[2:].zfill(h - 1)
add = []
for j in range(h - 1):
if i_bin[j] == "1":
... | p02733 |
# -*- coding: utf-8 -*-
import sys
from collections import defaultdict
H,W,K=list(map(int, sys.stdin.readline().split()))
S=[ sys.stdin.readline().strip() for _ in range(H) ]
ans=float("inf")
for bit in range(2**H):
cnt=0
group_num=0
GROUP={}
for i,s in enumerate(S):
if i==0:
... | # -*- coding: utf-8 -*-
import sys
from collections import defaultdict
H,W,K=list(map(int, sys.stdin.readline().split()))
S=[ sys.stdin.readline().strip() for _ in range(H) ]
ans=float("inf")
for bit in range(2**H):
cnt=0
group_num=0
GROUP={}
for i,s in enumerate(S):
if i==0:
... | p02733 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
H,W,K = list(map(int, readline().split()))
S = [readline().strip() for j in range(H)]
white = []
for line in S:
white.append(line.count("1"))
white_total = sum(white)
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
H,W,K = list(map(int, readline().split()))
S = [readline().strip() for j in range(H)]
white = []
for line in S:
white.append(line.count("1"))
white_total = sum(white)
... | p02733 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
H,W,K = list(map(int, readline().split()))
S = [readline().strip() for j in range(H)]
white = []
for line in S:
white.append(line.count("1"))
white_total = sum(white)
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
H,W,K = list(map(int, readline().split()))
S = [list(map(int, readline().strip())) for j in range(H)]
white = 0
for line in S:
white += sum(line)
if white <= K:
... | p02733 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
H,W,K = list(map(int, readline().split()))
S = [list(map(int, readline().strip())) for j in range(H)]
white = 0
for line in S:
white += sum(line)
if white <= K:
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
H,W,K = list(map(int, readline().split()))
S = [list(map(int, readline().strip())) for j in range(H)]
white = 0
for line in S:
white += sum(line)
if white <= K:
... | p02733 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.