input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n=int(eval(input()))
a=lnii()
money=1000
kabu=0
for i in range(n-1):
if a[i]<a[i+1]:
t_kabu=money//a[i]
kabu+=t_kabu
money-=t_kabu*a[i]
elif a[i]>a[i+1]:
mone... | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n=int(eval(input()))
a=lnii()+[0]
money=1000
kabu=0
for i in range(n):
if a[i]<a[i+1]:
t_kabu=money//a[i]
kabu+=t_kabu
money-=t_kabu*a[i]
elif a[i]>a[i+1]:
mo... | p02603 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
B = [0] + LI()
A = [0]
for i in range(N): # 要らないものを消す
if B[i] != B[i+1]:
A.append(B[i+1])
N = len(A)-1
MAX = [0,1000] + [0]*N # MAX[i] = i日目開始時... | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
A = LI()
# 買った株は翌日全て売ってよい
# 貪欲に
money = 1000
for i in range(N-1):
if A[i] < A[i+1]:
money += (A[i+1]-A[i])*(money//A[i])
print(money)
| p02603 |
n=int(eval(input()))
a=[int(i) for i in input().split()]
ans=[1000,0]
for i in range(1,n):
if a[i-1]<a[i]:
ans[0]+=ans[1]*a[i-1]
ans[1]=0
ans[1]=ans[0]//a[i-1]
ans[0]=ans[0]%a[i-1]
else:
ans[0]+=ans[1]*a[i-1]
ans[1]=0
print((ans[0]+ans[1]*a[-1]))
| n=int(eval(input()))
a=[int(i) for i in input().split()]
a.append(0)
x,y=1000,0
for i in range(n):
if a[i]>a[i+1]:
x+=y*a[i]
y=0
else:
y+=x//a[i]
x=x%a[i]
print((x+y*a[-2])) | p02603 |
n=int(eval(input()))
a=[int(i) for i in input().split()]
a.append(0)
x,y=1000,0
for i in range(n):
if a[i]>a[i+1]:
x+=y*a[i]
y=0
else:
y+=x//a[i]
x=x%a[i]
print((x+y*a[-2])) | n=int(eval(input()))
a=[int(i) for i in input().split()]
a.append(0)
x,y=1000,0
for i in range(n):
if a[i]>=a[i+1]:
x+=y*a[i]
y=0
else:
y+=x//a[i]
x=x%a[i]
print(x) | p02603 |
n = int(eval(input()))
a = list(map(int, input().split())) + [0]
buy, sell = [], []
for i in range(n):
if a[i] < a[i+1] and len(buy) - len(sell) == 0:
buy.append(i)
if len(buy) - len(sell) == 1 and a[i] > a[i+1]:
sell.append(i)
cash = 1000
for i, j in zip(buy, sell):
stock, res... | n = int(eval(input()))
a = list(map(int, input().split()))
cash = 1000
for buy, sell in zip(a, a[1:]):
if buy >= sell:
continue
stock, cash = divmod(cash, buy)
cash += stock * sell
print(cash) | p02603 |
n,*l=list(map(int,open(0).read().split()))
a,c=1000,0
for i in range(n-1):
s,t=l[i:i+2]
if s>t: a+=c*s; c=0
if s<t: c+=a//s; a-=a//s*s
print((a+c*t)) | n,*l=list(map(int,open(0).read().split()))
a=1000
for i in range(n-1):
s,t=l[i:i+2]
a+=a//s*max(t-s,0)
print(a) | p02603 |
n = int(eval(input()))
a = list(map(int, input().split()))
pairs = []
low = None
if a[0] < a[1]:
low = a[0]
for i in range(1, n):
if a[i-1] > a[i]:
if low is not None:
pairs.append((low, a[i-1]))
low = a[i]
if a[i-1] < a[i]:
if low is None:
low = a[i-1]
if low is not None and low < a[n... | n = int(eval(input()))
a = list(map(int, input().split()))
yen = 1000
for i in range(1, n):
if a[i-1] < a[i]:
stock = yen // a[i-1]
yen -= stock * a[i-1]
yen += stock * a[i]
print(yen) | p02603 |
import sys
sys.setrecursionlimit(4100000)
N = int(eval(input()))
A = list(map(int, input().split()))
pricelist = []
def dfs(day, money,stock):
if day == N:
pricelist.append(money+ stock * A[N-1])
return
price = A[day-1]
dfs(day+1, money % price, stock + money//price)
dfs... | N = int(eval(input()))
A = list(map(int, input().split()))
money = 1000
for i in range(N-2):
today, tomorrow = A[i], A[i+1]
if today < tomorrow:
money = (money//today)*tomorrow + money%today
if A[N-2]< A[N-1]:
money = (money//A[N-2]) * A[N-1] + money%A[N-2]
print(money)
| p02603 |
n = int(eval(input()))
a = list(map(int, input().split()))
# 貪欲法
# a[i] < a[i+1]なら全部買う
# a[i] > a[i+1]なら全部売る
money = 1000
stock = 0
for i in range(n):
if i == n-1 or a[i] > a[i+1]:
money += stock * a[i]
stock = 0
elif money > a[i]:
stock = money // a[i]
money = m... | n = int(eval(input()))
a = list(map(int, input().split()))
# DP
# dp[i]: i日目の所持金の最大値（持ち株は売る）
dp = [0] * n
dp[0] = 1000
# dp[1] = 0日目に全部買って1日目に全部売る or 0日目から何もしない
# dp[2] = 0 or 1日目に全部買って2日目に全部売る or 1日目から何もしない
# dp[i+1] + 0~i日目のどこかで全部買ってi+1日目に全部売る or i日目から何もしない
for i in range(n):
if i == 0:
dp[... | p02603 |
# coding: utf-8
def solve(*args: str) -> str:
n = int(args[0])
A = list(map(int, args[1].split()))
budget = 1000
stock = 0
temp = 0
for i in range(n-1):
if A[i] < A[i+1] and A[i] <= temp+budget:
budget += temp
temp = 0
stock = budget//... | # coding: utf-8
def solve(*args: str) -> str:
n = int(args[0])
A = list(map(int, args[1].split()))
budget = 1000
stock = 0
for i in range(n-1):
if A[i] < A[i+1] and A[i] <= budget:
stock, budget = divmod(budget, A[i])
elif A[i+1] < A[i]:
budget... | p02603 |
def main():
n = int(eval(input()))
A = list(map(int, input().split()))
INF = 19**18
X = []
Y = []
A = [INF] + A
for i in range(1, n):
if len(X) == len(Y):
if A[i-1] >= A[i] and A[i] < A[i+1]:
X.append(i)
if len(X) > len(Y):
... | n = int(eval(input()))
A = list(map(int, input().split()))
x = 1000
for i in range(n-1):
if A[i] < A[i+1]:
q, x = divmod(x, A[i])
x += q*A[i+1]
print(x) | p02603 |
N = int(eval(input()))
A = list(map(int,input().split()))
dp = [0] * N
dp[0] = 1000
for i in range(1, N):
dp[i] = dp[i - 1]
for j in range(i):
V = dp[j] // A[j]
W = dp[j] + (A[i] - A[j]) * V
dp[i] = max(dp[i], W)
print((dp[N - 1])) | N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1000
for i in range(N-1):
if A[i] < A[i+1]:
ans += ans // A[i] * (A[i+1] - A[i])
print(ans) | p02603 |
import sys
N=int(eval(input()))
alist=list(map(int,input().split()))
a2list=[alist[0]]
for i in range(1,N):
if a2list[-1]!=alist[i]:
a2list.append(alist[i])
#print(a2list)
N2=len(a2list)
if N2==1:
print((1000))
sys.exit(0)
yama_list=[False]*N2
tani_list=[False]*N2
if a2list[0]>a2list[1]:
... | N=int(eval(input()))
alist=list(map(int,input().split()))
money=1000
kabu=0
for i in range(N-1):
if alist[i]<alist[i+1]:
#buy as possible
k=money//alist[i]
kabu+=k
money-=k*alist[i]
elif alist[i]>alist[i+1]:
#sell all
money+=alist[i]*kabu
kabu=0
money+=alist[N-1]*kabu ... | p02603 |
import itertools
#n, k = map(int,input().split())
n = int(eval(input()))
al = list(map(int,input().split()))
ans = 0
for v in itertools.product(list(range(2)),repeat=n):
money = 1000
kabu = 0
for i in range(n):
if v[i] == 0:
kabu += money // al[i]
money = money... | n = int(eval(input()))
al = list(map(int,input().split()))
kabu = 0
money = 1000
for i in range(n-1):
if al[i] < al[i+1]:
# 全部売る
money += kabu * al[i]
kabu = 0
# 全部買う
kabu += money // al[i]
money = money % al[i]
else:
# 全部売る
money +... | p02603 |
N = int(eval(input()))
A = list(map(int,input().split()))+[0]
kane = 1000
kabu = 0
baibai = []
#1は買い時、-1は売り時、0は無視
for i in range(N):
sa = A[i+1] -A[i]
if sa == 0:
baibai.append(0)
elif sa != abs(sa):
baibai.append(-1)
else:
baibai.append(1)
#最後の売り時
if 1 in bai... | N = int(eval(input()))
A = list(map(int,input().split()))+[0]
kane = 1000
kabu = 0
baibai = []
#1は買い時、-1は売り時、0は無視
for i in range(N):
sa = A[i+1] -A[i]
if sa == 0:
baibai.append(0)
elif sa != abs(sa):
baibai.append(-1)
else:
baibai.append(1)
#baibai通りに売買(最後の売り... | p02603 |
n=int(input())
a=list(map(int,input().split()))
b=[a[0]]
f=-1
for i in a:
if b[-1]<i:
if f==1:b[-1]=i
else:
b.append(i)
f=1
if b[-1]>i:
if f==-1:b[-1]=i
else:
b.append(i)
f=-1
if f==-1:del b[-1]
if len(b)==0:exit(print(1000))
now=1000
for i in range(0,len(b)... | n=int(input())
a=list(map(int,input().split()))
b=[a[0]]
f=-1
for i in a:
if b[-1]<i:
if f==1:b[-1]=i
else:
b.append(i)
f=1
if b[-1]>i:
if f==-1:b[-1]=i
else:
b.append(i)
f=-1
if f==-1:del b[-1]
if len(b)==0:exit(print(1000))
ans=1000
for i in range(0,len(b)... | p02603 |
n, *a = list(map(int, open(0).read().split()))
max_a = max(a)
money = 1000
stock = 0
for i in range(n-1):
if a[i] < a[i+1]:
stock = money // a[i]
money += (a[i+1] - a[i]) * stock
print(money) | n, *a = list(map(int, open(0).read().split()))
money = 1000
stock = 0
for i in range(n-1):
if a[i] < a[i+1]:
stock = money // a[i]
money += (a[i+1] - a[i]) * stock
print(money) | p02603 |
n= int(eval(input()))
arr = [int(x) for x in input().strip().split()]
mem = {}
def helper(i, mon, stk):
key = (i, mon, stk)
if key in mem:
return mem[key]
if i==len(arr):
return mon
ans = helper(i+1, mon, stk)
buy = 1
while True:
if arr[i]*buy<=m... | n= int(eval(input()))
arr = [int(x) for x in input().strip().split()]
def Greedy(arr):
curr = 1000
for i in range(len(arr)-1):
if arr[i+1]>arr[i]:
stocks = curr // arr[i]
curr += (arr[i+1] - arr[i])*stocks
return curr
print((Greedy(arr)))
# m... | p02603 |
def main():
n = int(eval(input()))
A = [int(x) for x in input().split()]
money = 1000
kabu_c = 0
l = list()
for i in range(n-1):
if A[i+1] - A[i] > 0:
l.append(1)
else:
l.append(0)
for idx, i in enumerate(l):
if i == 1:
... | def main():
n = int(eval(input()))
A = [int(x) for x in input().split()]
money = 1000
kabu_c = 0
l = list()
for i in range(n-1):
if A[i+1] - A[i] > 0:
l.append(1)
else:
l.append(0)
for idx, i in enumerate(l):
if i == 1 and money - A... | p02603 |
N = int(eval(input()))
A = list(map(int, input().split()))
syoji = 1000
kabu = 0
kai = 0
uri = 0
if N ==1:
print(syoji)
exit()
sw = 0
for i in range(N):
if i<N-1 and kabu == 0 and A[i] < A [i+1]:
for j in range(i+1,N):
if sw ==1 and uri >= A[j]:
break
elif A[i] < A[j]:
... | N = int(eval(input()))
A = list(map(int, input().split()))
syoji = 1000
kabu = 0
kai = 0
uri = 0
if N ==1:
print(syoji)
exit()
sw = 0
for i in range(N):
if i<N-1 and kabu == 0 and A[i] < A [i+1]:
for j in range(i+1,N):
if sw ==1 and uri >= A[j]:
break
elif A[i] < A[j]:
... | p02603 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = int(readline())
a = list(map(int, readline().split()))
money = 1000
stock = 0
day = 0
while day < n - 1:
if stock == 0:
cur = a[... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = int(readline())
a = [0] + list(map(int, readline().split()))
dp = [0] * (n + 1)
dp[0] = 1000
for i in range(1, n + 1):
dp[i] = dp[i - 1]
fo... | p02603 |
from sys import stdin
input = stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
start = 0
money = 1000
for i in range(N - 1):
if A[i + 1] > A[i]:
tmp = 10 ** 3
for k in range(i, start - 1, -1):
tmp = min(A[k], tmp)
buy = money // tmp
... | from sys import stdin
input = stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
start = 0
money = 1000
for i in range(N - 1):
if A[i + 1] > A[i]:
buy = money // A[i]
money -= A[i] * buy
money += buy * A[i + 1]
print(money)
| p02603 |
n = int(eval(input()))
A = list(map(int, input().split()))
ans = 1000
for ii in range(2 ** n):
tmp = 1000
kab = 0
action = 'buy'
for i in range(n):
if (ii >> i) & 1:
if action == 'buy':
if tmp < A[i]:
break
kab += tmp //... | n = int(eval(input()))
A = list(map(int, input().split()))
ans = 1000
for i in range(n - 1):
if A[i] < A[i + 1]:
ans += ans // A[i] * (A[i + 1] - A[i])
print(ans) | p02603 |
n = int(eval(input()))
a = list(map(int, input().split()))
cur_m = 1000
cur_s = 0
state = -1 # 1:up 0:down
prev = 0
for ai in a:
if state == -1:
prev = ai
state = 0
elif state == 1:
if prev > ai: # peak
# sell at prev
cur_m += (prev * cur_s)
cur_s = 0
state = 0... | n = int(eval(input()))
a = list(map(int, input().split()))
cur_m = 1000
cur_s = 0
state = -1 # 1:up 0:down
prev = 0
for ai in a:
if state == -1:
prev = ai
state = 0
elif state == 1:
if prev > ai: # peak
# sell at prev
cur_m += (prev * cur_s)
cur_s = 0
state = 0... | p02603 |
import sys
sys.setrecursionlimit(10**6)
n = int(eval(input()))
A = list(map(int, input().split()))
ans = 1000
def dfs(money, share, day):
global ans
if day > n:
ans = max(ans, money)
return
max_buy = money//A[day-1]
max_sel = share
# for n_buy in range(-max_sel, max_... | import sys
sys.setrecursionlimit(10**6)
n = int(eval(input()))
A = list(map(int, input().split()))
CurrentMoney = 1000
for i in range(0, n-1):
Stocks = 0
if A[i] < A[i+1]: Stocks = CurrentMoney // A[i]
CurrentMoney += (A[i+1] - A[i]) * Stocks
print(CurrentMoney) | p02603 |
N = int(eval(input()))
A = list(map(int,input().split()))
money=1000
best = money
pos = 1
kabu = 0
#初動 買うか買わないか
if A[0]<=A[1]:
kabu = money//A[0]
money -= kabu*A[0]
pos=0
else:
pos=1
#二回目以降 買うか売るか保留か
for i in range(1,N):
if pos==0:#売り
if A[i-1]>=A[i]:
money... | N = int(eval(input()))
A = list(map(int,input().split()))
money=1000
pos = 1
kabu = 0
for i in range(1,N):
if A[i-1]<A[i]:
kabu = money//A[i-1]
money += kabu*(A[i]-A[i-1])
print(money) | p02603 |
N = int(eval(input()))
A = list(map(int, input().split()))
t = [-1] * (N + 1)
t[0] = 1000
for i in range(N):
t[i + 1] = max(t[i + 1], t[i])
k = t[i] // A[i]
y = t[i] % A[i]
for j in range(i + 1, N):
t[j + 1] = max(t[j + 1], k * A[j] + y)
print((t[N]))
| N = int(eval(input()))
A = list(map(int, input().split()))
t = [-1] * (N + 1)
t[0] = 1000
for i in range(N):
k = t[i] // A[i]
y = t[i] % A[i]
for j in range(i, N):
t[j + 1] = max(t[j + 1], k * A[j] + y)
print((t[N]))
| p02603 |
N = int(eval(input()))
A = list(map(int,input().split()))
money = 1000
kabu = 0
for i in range(N-1):
if A[i+1] < A[i]:
while kabu != 0:
money += A[i]
kabu -= 1
else:
while money >= A[i]:
money -= A[i]
kabu += 1
while kabu != 0:
mo... | N = int(eval(input()))
A = list(map(int,input().split()))
money = 1000
kabu = 0
for i in range(N-1):
if A[i+1] < A[i]:
money += A[i] * kabu
kabu = 0
else:
kabu += money//A[i]
money -= A[i] * (money//A[i])
#print(kabu,money)
money += A[-1] * kabu
print(money)
| p02603 |
n = int(eval(input()))
a = list(map(int, input().split()))
# dp[buy][sell]
dp = [0 for j in range(n)]
dp[0] = 1000
for i in range(n):
ai = a[i]
m = dp[i]
s = m // ai
for j in range(i + 1, n):
dp[j] = max(dp[j], m + s * (a[j] - ai))
for j in range(n - 1):
dp[j + 1] = m... | n = int(eval(input()))
a = list(map(int, input().split()))
a_cur = a[0]
m = 1000
s = 0
for i in range(1, n):
a_next = a[i]
if a_cur < a_next:
# buy current and sell next
s = m // a_cur
m += s * (a_next - a_cur)
a_cur = a_next
print(m) | p02603 |
n = int(eval(input()))
a = list(map(int,input().split()))
dp = [[-1]*100000 for i in range(n+1)]
dp[0][0] = 1000
for i in range(n):
for j in range(99999):
dp[i+1][j] = max(dp[i+1][j],dp[i][j])
if dp[i+1][j] >= a[i]:
dp[i+1][j+1] = max(dp[i+1][j+1],dp[i+1][j]-a[i])
... | n = int(eval(input()))
a = list(map(int,input().split()))
count = [1000,0]
x = a[0]
for i in range(1,n):
if a[i] > x:
d = count[0]//x
count = [count[0]-d*x, d+count[1]]
else:
count = [count[0]+count[1]*x,0]
x = a[i]
if count[1]:
count[0] += count[1]*x
print((count[... | p02603 |
n, *a = list(map(int, open(0).read().split()))
m = 1000
for a, b in zip(a, a[1:]):
if a < b:m = m // a * b + m % a
print(m) | n, *a = list(map(int, open(0).read().split()))
a += 1,
m = 1000
def groupby():
c, res = [], []
for i in range(n + 1):
if a[i-1] <= a[i]:
pass
else:
res += [c[0], c[-1]],
c = []
c += a[i],
return res
for i, j in groupby():
m = m // i * j + m % i
print(m) | p02603 |
N = int(eval(input()))
A = list(map(int, input().split()))
iStock = 0
iMoney = 1000
for i in range(N-1):
if A[i] < A[i + 1]:
# A[i]Day 株購入 & a[i+1]Day 株売却
iStock = iMoney // A[i]
iMoney %= A[i]
iMoney += iStock * A[i+1]
print(iMoney)
| N = int(eval(input()))
A = list(map(int, input().split()))
iStock = 0
iMoney = 1000
for i in range(N-1):
if A[i] < A[i + 1]:
# A[i]Day 株購入 & A[i+1]Day 株売却
iStock = iMoney // A[i]
iMoney %= A[i]
iMoney += iStock * A[i+1]
print(iMoney) | p02603 |
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
from functools import lru_cache
class Solution:
def __init__(self,prices):
self._max = 0
self.prices = prices
self.n = len(prices)
@lru_cache(None)
def transaction(self, money, stock, i, la... | import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def maxProfit(prices) -> int:
if len(prices) < 2:
return 0
ans = 1000
for i in range(1,len(prices)):
if prices[i] > prices[i - 1]:
stock = ans // prices[i - 1]
ans += stock * (prices[... | p02603 |
n = int(eval(input()))
a = list(map(int,input().split()))
k_y = [1000]
for i in range(n):
genkin_list = [ hk * a[i] + hy for hk,hy in enumerate(k_y) ] #所持株、金
genkin_list_max = max(genkin_list)
max_index = genkin_list.index(genkin_list_max)
k_y = [ genkin_list_max - a[i] * j for j in range(genkin_list_ma... | n = int(eval(input()))
a = list(map(int,input().split()))
k_y = [1000]
yen = 1000
resyen = 1000
kabu_max = 0
for i in range(n):
#株を売り払うケース
newyen = max( yen, kabu_max * a[i] + resyen)
#株を最大買うケース
kabu_max_new = max( kabu_max + resyen // a[i], yen // a[i] )
if kabu_max_new == yen // a[i]:
if kabu_... | p02603 |
def INT():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
N = INT()
A = LI()
ans = 1000
purchase = 0
for i in range(1, N):
tmp = ans
if A[i] > A[i - 1]:
while True:
if tmp - A... | def INT():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
N = INT()
A = LI()
ans = 1000
for i in range(1, N):
tmp = ans
if A[i] > A[i - 1]:
purchase = tmp // A[i - 1]
ans = max(ans, tmp ... | p02603 |
from collections import deque
n = int(eval(input()))
a = list(map(int,input().split()))
m = 1000
ans = 1000
ans_list=[]
q = deque([[1000, 0, n, 0]])
while len(q) != 0:
tmp = q.popleft()
m,k,d,i = tmp[0],tmp[1],tmp[2],tmp[3]
if d == 0 and m > ans:
ans = m
ans_list.append(m)
... | n = int(eval(input()))
a = list(map(int,input().split()))
k = 0
ans = 1000
for i in range(n-1):
if a[i] < a[i+1]:
k = ans//a[i]
ans -= a[i]*k
ans += a[i+1]*k
print(ans)
| p02603 |
import sys
from collections import deque,defaultdict
I=sys.stdin.readline
def ii():
return int(I().strip())
def li():
return list(map(int,I().strip().split()))
def mi():
return list(map(int,I().strip().split()))
def main():
n=ii()
arr=li()
p=1000
for i in range(n-1):
if arr[i]==arr[i+1]... | import sys
from collections import deque,defaultdict
I=sys.stdin.readline
def ii():
return int(I().strip())
def li():
return list(map(int,I().strip().split()))
def mi():
return list(map(int,I().strip().split()))
def main():
n=ii()
arr=li()
p=1000
for i in range(n-1):
if arr[i]<arr[i+1]:... | p02603 |
import io
import os
from collections import Counter, defaultdict, deque
from functools import lru_cache
import sys
sys.setrecursionlimit(10 ** 5)
def solve(N, A):
@lru_cache(maxsize=None)
def maxProfitAtEnd(i, money, stocks):
if i == N - 1:
# Sell all remaining
... | import io
import os
from collections import Counter, defaultdict, deque
from functools import lru_cache
import sys
sys.setrecursionlimit(10 ** 5)
def solve(N, A):
@lru_cache(maxsize=None)
def maxProfitAtEnd(i, money, stocks):
if i == N - 1:
# Sell all remaining
... | p02603 |
import sys
N = int(eval(input()))
A = list(map(int, input().split()))
kai = [False] * N
uri = [False] * N
# 買いポイント探す
i = 0
# すべて同じ株価or単調減少
tmp = A[0]
flag = True
for i in range(1, N):
if A[i-1] < A[i]:
flag = False
if flag:
print((1000))
sys.exit(0)
start = 10000
stop = 10... | N = int(eval(input()))
A = list(map(int, input().split()))
dp = [0]*(N)
dp[0] = 1000
for i in range(1,N):
dp[i] = dp[i-1]
for j in range(i):
dp[i] = max(dp[i], (dp[j]//A[j])*A[i]+dp[j]%A[j])
ans = 0
for i in range(N):
ans = max(ans, dp[i])
print(ans) | p02603 |
n = int(eval(input()))
A = [*list(map(int, input().split()))] + [0]
yen = 1000
kabu_yen = kabu_n = 0
for i in range(1,n+1):
if A[i-1] < A[i]: # buy
m = yen // A[i-1]
cost = m * A[i-1]
yen -= cost
kabu_yen += cost
kabu_n += m
elif A[i-1] > A[i]: # sell
... | n = int(eval(input()))
A = [*list(map(int, input().split()))] + [0]
yen = 1000
kabu_yen = kabu_n = 0
for i in range(n):
if A[i] < A[i+1]: # buy
m = yen // A[i]
cost = m * A[i]
yen -= cost
kabu_yen += cost
kabu_n += m
elif A[i] > A[i+1]: # sell
yen += k... | p02603 |
n = int(eval(input()))
A = [*list(map(int, input().split()))] + [0]
yen = 1000
kabu_yen = kabu_n = 0
for i in range(n):
if A[i] < A[i+1]: # buy
m = yen // A[i]
cost = m * A[i]
yen -= cost
kabu_yen += cost
kabu_n += m
elif A[i] > A[i+1]: # sell
yen += k... | n = int(eval(input()))
A = [*list(map(int, input().split()))] + [0]
yen, stock = 1000, 0
nxt = A[0]
for now in A[1:]:
now, nxt = nxt, now
if now < nxt:
stock += yen // now
yen -= yen // now * now
else:
yen += stock * now
stock = 0
print((yen + stock * nxt))
| p02603 |
n = int(eval(input()))
A = [0] + [*list(map(int, input().split()))]
dp_stock = [0]*(n+1)
dp_yen = [0]*(n+1)
dp_yen[0] = 1000
for day in range(1, n+1):
dp_stock[day] = max(dp_stock[day-1], dp_yen[day-1] // A[day])
remain = dp_yen[day-1] - dp_stock[day-1]*A[day-1]
dp_yen[day] = max(dp_yen[day-1], rema... | n = int(eval(input()))
A = [0] + [*list(map(int, input().split()))] + [0]
dp_yen = [0]*(n+1)
dp_yen[1] = 1000
for day in range(1, n):
stock = 0
if A[day] > 0: stock = dp_yen[day] // A[day]
remain = dp_yen[day] - stock*A[day]
dp_yen[day+1] = max(dp_yen[day], remain + stock * A[day+1])
print((dp_... | p02603 |
n = int(eval(input()))
A = [*list(map(int, input().split()))] + [0]
dp_yen = [0]*(n+1)
dp_yen[0] = 1000
for day in range(n):
dp_yen[day+1] = max(dp_yen[day], dp_yen[day] + (A[day+1] - A[day]) * (dp_yen[day] // A[day]))
print((dp_yen[n]))
| n = int(eval(input()))
A = [*list(map(int, input().split()))] + [0]
dp_yen = [1000]*(n+1)
for day in range(n):
dp_yen[day+1] = max(dp_yen[day], dp_yen[day] + dp_yen[day]//A[day] * (A[day+1] - A[day]))
print((dp_yen[n]))
| p02603 |
from collections import deque
n = int(eval(input()))
a = list(map(int,input().split()))
stack = deque()
stack.append([1000,0,0,200])
ans = []
while stack:
money,kabu,i,temp = stack.pop()
ans.append(money)
if i<n:
stack.append([money,kabu,i+1,temp])
if a[i]<temp and a[i]<=money:
kabu += m... | n = int(eval(input()))
a = list(map(int,input().split()))
money = 1000
kabu = 0
for i in range(n-1):
if kabu==0:
if a[i]<=a[i+1]:
kabu += money//a[i]
money %= a[i]
else:
if a[i]>a[i+1]:
money += kabu*a[i]
kabu = 0
print((money+kabu*a[-1])) | p02603 |
n = int(eval(input()))
a = [-1] + list(map(int, input().split()))
# dp[i] = (i+1)日目終了時点での金額の最大値
# dp[i] = max(dp[i-1], {dp[j-1] % a[j] + (dp[j-1] // a[j]) * a[i] | j<i})
dp = [0] * (n + 1)
dp[0] = dp[1] = 1000
dp[2] = max(dp[0] % a[1] + (dp[0] // a[1]) * a[2], dp[1])
for i in range(1, n + 1):
cand = dp[... | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1000
for i in range(n - 1):
if a[i] < a[i + 1]:
ans = ans % a[i] + (ans // a[i]) * a[i + 1]
print(ans)
| p02603 |
def main():
N = int(eval(input()))
*A, = list(map(int, input().split()))
money = 1000
low = A[0]
high = -1
for x in A:
if high < x:
high = x
continue
if high > x:
money += (high - low) * (money // low)
low = high =... | def main():
N = int(eval(input()))
*A, = list(map(int, input().split()))
money = 1000
low = A[0]
p = A[0]
for x in A:
if p > x:
money += (p - low) * (money // low)
low = x
p = x
money += max(0, p - low) * (money // low)
print(mo... | p02603 |
def main():
N = int(eval(input()))
*A, = list(map(int, input().split()))
money = 1000
low = A[0]
p = A[0]
for x in A:
if p > x:
money += (p - low) * (money // low)
low = x
p = x
money += (p - low) * (money // low)
print(money)
... | def main():
_ = int(eval(input()))
*A, = list(map(int, input().split()))
A += [0]
money = 1000
stock = 0
for a, b in zip(A, A[1:]):
money += stock * a
stock = 0
if a < b:
buy, rest = divmod(money, a)
stock = buy
money = re... | p02603 |
n = int(eval(input()))
A = list(map(int, input().split()))
ans = 1000
buy = -1
for bit in range(2 ** n):
money = 1000
stock = 0
for i in range(n):
if (bit >> i) & 1:
buy = i
stock += money // A[i]
money -= A[i] * (money // A[i])
else:
... | n = int(eval(input()))
A = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(n-1):
if A[i] < A[i+1]:
tmp = money // A[i]
stock += tmp
money -= tmp * A[i]
if A[i] > A[i+1]:
money += stock * A[i]
stock = 0
money += stock * A[-1]
print(mo... | p02603 |
N = int(eval(input()))
A = list(map(int,input().split()))
money=1000
stocks=0
for i in range(N):
if i==N-1:
#売る
while stocks>0:
money += A[i]
stocks-=1
elif A[i+1]>A[i]:
#買う
while money>=A[i]:
money -= A[i]
st... | N = int(eval(input()))
A = list(map(int,input().split()))
money=1000
stocks=0
for i in range(N):
if i==N-1:
#売る
money+=(A[i]*stocks)
stocks=0
elif A[i+1]>A[i]:
#買う
plus_stock,money=divmod(money,A[i])
stocks+=plus_stock
elif A[i+1]<A[i]:
... | p02603 |
N = int(eval(input()))
A = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(N - 1):
if A[i] == A[i + 1]:
continue
elif A[i] > A[i + 1]:
while stock > 0:
money += A[i]
stock -= 1
elif A[i] < A[i + 1]:
while money >= A[i]:
... | N = int(eval(input()))
A = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(N - 1):
if A[i] == A[i + 1]:
continue
elif A[i] > A[i + 1]:
money += A[i] * stock
stock = 0
elif A[i] < A[i + 1]:
buy = money // A[i]
money -= A[i] * buy
... | p02603 |
N = int(eval(input()))
prices = [int(n) for n in input().split()]
money = 1000
stock = 0
p_today = prices[0]
for n in range(N-1):
p_tomm = prices[n+1]
if p_tomm >= p_today:
while money >= p_today:
stock += 1
money -= p_today
else:
money += p_today * stock
... | N = int(eval(input()))
prices = [int(n) for n in input().split()]
money = 1000
stock = 0
p_today = prices[0]
for n in range(N-1):
p_tomm = prices[n+1]
if p_tomm >= p_today:
n_stock = money // p_today
stock += n_stock
money = money - p_today * n_stock
# while money >= p... | p02603 |
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_()... | n,*a=list(map(int,open(0).read().split()))
x=1000
for i in range(n-1):x+=x//a[i]*max(0,a[i+1]-a[i])
print(x) | p02603 |
N = int(eval(input()))
A = list(map(int,input().split()))
fp = A[0]
tmp = 0
c = 1000
stock = 0
IsSearchTop = False
first = True
for i in range(1,N):
if first:
if fp > A[i]:
fp = A[i]
elif fp < A[i]:
stock += c // fp
c -= stock * fp
IsS... | N = int(eval(input()))
A = list(map(int,input().split()))
fp = A[0]
tmp = 0
c = 1000
stock = 0
IsSearchTop = False
first = True
for i in range(1,N):
#
if IsSearchTop:
if fp <= A[i]:
fp = A[i]
if i == N-1:
c += stock * fp
... | p02603 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.append(0)
B = []
f = True
for i in range(N):
if f:
if A[i] < A[i+1]:
B.append(A[i])
f = False
else:
if A[i] > A[i+1]:
B.append(A[i])
f = True
if len(B) == 0:
pr... | N = int(eval(input()))
A = list(map(int, input().split()))
A.append(0)
kabu = 0
en = 1000
for i in range(N):
a, b = divmod(en, A[i])
kabu += a
en = b
if A[i+1] < A[i]:
en += kabu*A[i]
kabu = 0
print(en) | p02603 |
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;cnt = 0 ;pro = 1
n = int(eval(input()))
A = list(map(int, input().split()))
now = 1000
for i in range(n-1):
if A[i] < A[i+1]:
... | n = int(eval(input()))
A = list(map(int, input().split()))
now = 1000
for i in range(n-1):
if A[i] < A[i+1]:
stocks = now // A[i]
now += (A[i+1] - A[i])*stocks
print(now) | p02603 |
def solve():
ans = 0
N = int(eval(input()))
A = [float('inf')]+list(map(int, input().split()))+[-float('inf')]
UD = [0]*(N+1)
for i in range(N+1):
if A[i]>A[i+1]:
UD[i] = -1
elif A[i]<A[i+1]:
UD[i] = 1
else:
UD[i] = UD[i-1]
UD2 = [0]*N
for i in range(N):
if ... | N = int(eval(input()))
A = list(map(int, input().split()))
def sell(money,stock,price):
money += price*stock
stock = 0
return money, stock
def buy(money,price):
stock,money = divmod(money,price)
return money,stock
money = 1000
stock = 0
for i in range(N):
money, stock = sell(money,stock,A[... | p02603 |
n = int(eval(input()))
a = list(map(int, input().split()))
stock_dp = [[0, 0] for _ in range(n+1)]
value_dp = [0] * (n + 1)
value_dp[0] = 1000
for i in range(1, n + 1):
x = value_dp[i - 1]
y = stock_dp[i - 1][0] + stock_dp[i - 1][1] * a[i - 1]
if x > y:
value_dp[i] = x
else:
... | n = int(eval(input()))
a = list(map(int, input().split()))
stock = 0
rest = 0
value = 1000
for i in range(1, n + 1):
value = max(value, stock * a[i - 1] + rest)
stock = value // a[i - 1]
rest = value % a[i - 1]
print(value) | p02603 |
n = int(eval(input()))
a = list(map(int, input().split()))
state_of_up_or_down = False
money = 1000
min_price = a[0]
max_price = a[0]
for i in range(1, n):
if a[i] > a[i - 1]:
# min_price = min(a[i - 1], min_price)
max_price = a[i]
state_of_up_or_down = True
if i == n - ... | n = int(eval(input()))
a = list(map(int, input().split()))
# state_of_up_or_down = False
money = 1000
# min_price = a[0]
# max_price = a[0]
for i in range(1, n):
if a[i] > a[i - 1]:
# max_price = a[i]
# state_of_up_or_down = True
money = (money // a[i-1]) * a[i] + money % a[i-1]
... | p02603 |
n = int(eval(input()))
a = list(map(int, input().split()))
# state_of_up_or_down = False
money = 1000
# min_price = a[0]
# max_price = a[0]
for i in range(1, n):
if a[i] > a[i - 1]:
# max_price = a[i]
# state_of_up_or_down = True
money = (money // a[i-1]) * a[i] + money % a[i-1]
... | n = int(eval(input()))
a = list(map(int, input().split()))
money = 1000
for i in range(1, n):
if a[i] > a[i - 1]:
money = (money // a[i-1]) * a[i] + money % a[i-1]
else:
pass
print(money) | p02603 |
from bisect import bisect_right
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
INF = 10 ** 18
last_max = A[0]
last_min = A[0]
money = 1000
stock = 0
old_trend = 0
trend = A[1] - A[0]
buy_point = []
bought_point = []
for i in rang... | from bisect import bisect_right
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
money = 1000
stock = 0
old_trend = 0
trend = A[1] - A[0]
buy_point = []
bought_point = []
for i in range(N-1):
trend = A[i+1] - A[i]
if trend * old... | p02603 |
import sys
import heapq, math
from bisect import bisect_right
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
N = int(eval(input()))
A = list(m... | N = int(eval(input()))
A = list(map(int, input().split()))
i = 0
yen = 1000
while i < N:
while i < N - 1 and A[i] >= A[i + 1]:
i += 1
if i == N - 1:
break
x = i
while i < N - 1 and A[i] <= A[i + 1]:
i += 1
y = i
cnt = yen // A[x]
yen = yen - ... | p02603 |
n = int(eval(input()))
alst = list(map(int, input().split()))
lst = [[0, [0, 0]] for _ in range(n)]
lst[0][0] = 1000
lst[0][1][0] = 1000 // alst[0]
lst[0][1][1] = 1000 % alst[0]
for i, num in enumerate(alst[1:], start = 1):
m1 = lst[i - 1][1][1] + lst[i - 1][1][0] * num
lst[i][0] = max(lst[i - 1][0], ... | n = int(eval(input()))
alst = list(map(int, input().split()))
dp = [[1000, [0, 0]]]
for a in alst:
tmp1 = max(dp[-1][0], dp[-1][1][0] * a + dp[-1][1][1])
tmp2 = tmp1 // a
tmp3 = tmp1 % a
dp.append([tmp1, [tmp2, tmp3]])
print((dp[-1][0])) | p02603 |
N=int(eval(input()))
A=list(map(int, input().split()))
A.append(0)
L=[0]*N
L[0]=1000
# dpしろ
for i in range(1,N):
B=[0]*(i+1)
for j in range(i):
t=L[j]//A[j]
B[j]=L[j]%A[j] + t*A[i]
B[i]=L[i-1]
L[i]=max(B)
print((L[N-1])) | N = int(eval(input()))
A = list(map(int, input().split()))
d = [0]*N
d[0] = 1000
for i in range(1, N):
if A[i-1] < A[i]:
d[i] = d[i-1]+(d[i-1]//A[i-1])*(A[i]-A[i-1])
else:
d[i] = d[i-1]
print((d[-1]))
| p02603 |
n = int(eval(input()))
A = list(map(int, input().split()))
M = 1000
for i in range(n-1):
dp = list(range(M+1))
a, b = A[i], A[i+1]
for j in range(M+1):
if j >= a:
dp[j] = max(dp[j-a]+b, dp[j])
M = dp[M]
ans = M
print(ans) | n = int(eval(input()))
A = list(map(int, input().split()))
x, y, z = 1000, 0, 1000
for a in A:
s1, t1 = divmod(x, a)
s2, t2 = divmod(z, a)
s2 += y
if s1 > s2:
y, z = s1, t1
elif s2 > s1:
y, z = s2, t2
else:
y, z = s1, max(t1, t2)
x = max(x, y*a+z)
ans = x
print(ans) | p02603 |
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [0] * N
dp[0] = 1000
for i in range(1, N):
dp[i] = dp[i - 1]
for j in range(i):
kabu = dp[j] // A[j]
money = dp[j] + (A[i] - A[j]) * kabu
dp[i] = max(dp[i], money)
print((dp[-1])) | N = int(eval(input()))
A = list(map(int, input().split()))
money = 1000
for i in range(N-1):
t = money + (A[i + 1] - A[i]) * (money // A[i])
money = max(money, t)
print(money) | p02603 |
def solve():
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [0 for j in range(N+1)]
dp[0] = 1000
for i in range(1, N+1):
for j in range(i):
dp[i] = max(dp[i], dp[j])
for j in range(1, i):
dp[i] = max(dp[i], dp[j] % A[j-1]+A[i-1]*(dp[j... | def solve():
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1000
for i in range(1, N):
x, y = A[i-1], A[i]
if (x < y):
ans = y*(ans//x) + ans % x
print(ans)
if __name__ == "__main__":
solve() | p02603 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
def dfs(i, stock, money):
global N
global A
global ans
# print(i, stock, money)
if i == N:
ans = max(ans, money)
return
nextStock = int(stock)
nextMoney = int(money)
dfs(i+1, nextStock, ... | N = int(eval(input()))
A = list(map(int, input().split()))
money = 1000
stack = 0
for i in range(N-1):
if A[i] < A[i+1]:
stack = money // A[i]
money += (A[i+1] - A[i]) * stack
stack = 0
print(money)
| p02603 |
n=int(eval(input()))
list=[[0]*n]
list=input().split()
for i in range(n):
list[i]=int(list[i])
yen=1000
stock=0
keikou=0
for i in range(1,n):
if list[i]-list[i-1]<=0:
keikou+=1
if keikou!=n-1:
for t in range(1,n):
if list[t]-list[t-1]>=0:
while(yen>=list[t-1]):
yen-=list[t-1... | n=int(eval(input()))
list=[[0]*n]
list=input().split()
for i in range(n):
list[i]=int(list[i])
yen=1000
stock=0
keikou=0
for i in range(1,n):
if list[i]-list[i-1]<=0:
keikou+=1
if keikou!=n-1:
for t in range(1,n):
if list[t]-list[t-1]>=0:
stock+=int(yen/list[t-1])
yen-=list[t-... | p02603 |
n = int(eval(input()))
a = list(map(int,input().split()))
m = 1000
kabu = 0
for i in range(n-1):
if a[i] < a[i+1]:
kabu += m//a[i]
m -= (m//a[i])*a[i]
else:
m += a[i]*kabu
kabu = 0
print((m+kabu*a[-1])) | n = int(eval(input()))
a = list(map(int,input().split()))
m = 1000
kabu = 0
for i in range(n-1):
if a[i] < a[i+1]:
x = m//a[i]
kabu += x
m -= x*a[i]
else:
m += kabu*a[i]
kabu = 0
print((m+(kabu*a[-1]))) | p02603 |
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [[-1]*n for i in range(5000)]
for i in range(1000//a[0]+1):
dp[i][0] = 1000-a[0]*i
for i in range(1, n):
for g in range(5000):
for l in range(5000):
if dp[l][i-1] >= 0:
if l < g:
... | n = int(eval(input()))
a = list(map(int, input().split())) + [-1]
money = 1000
k = 0
for i in range(n):
if a[i+1] > a[i]:
k += money//a[i]
money = money - a[i]*(money//a[i])
elif a[i+1] <= a[i]:
money += k*a[i]
k = 0
print(money)
| p02603 |
n = int(eval(input()))
a = list(map(int,input().split()))
m = 1000
stocks = 0
drops = [False]*(n-1)
for i in range(n-1):
if a[i] > a[i+1]:
drops[i] = True
for i in range(n-1):
if drops[i]:
m+=stocks*a[i]
stocks = 0
else:
stocks+=m//a[i]
m -= (m//a[i])*a[... | def main():
N=int(eval(input()))
A=list(map(int,input().split()))
ans=1000
stocks=0
for i in range(N-1):
if A[i]>A[i+1]:
ans+=stocks*A[i]
stocks=0
else:
stocks+=(ans//A[i])
ans-=(ans//A[i])*A[i]
print((ans+stocks*A[-1]))... | p02603 |
from collections import deque
N = int(eval(input()))
A = list([int(x) for x in input().split()])
stack = deque()
stack.appendleft((0, 1000, 0))
max_money = 1000
while stack:
target = stack.popleft()
day = target[0]
money = target[1]
stock = target[2]
if day + 1 <= N:
... | N = int(eval(input()))
A = list([int(x) for x in input().split()])
money = 1000
stock = 0
for i in range(N-1):
if A[i] <= A[i+1]:
stock += money // A[i]
money -= (money // A[i]) * A[i]
else:
money += A[i] * stock
stock = 0
print((money + stock * A[N-1]))
| p02603 |
n = int(eval(input()))
a = list(map(int, input().split()))
buy = [0] * n
sell = [0] * n
prev = 1000
for i in range(n - 1):
if a[i+1] > a[i]:
buy[i] += 1
if a[i+1] < a[i]:
sell[i] += 1
for i in range(n - 1, 0, -1):
if a[i-1] < a[i]:
buy[i-1] += 1
if a[i-1] >... | INF = 300
n = int(eval(input()))
a = [INF] + list(map(int, input().split())) + [-INF]
money = 1000
stock = 0
for e1, e2 in zip(a, a[1:]):
if e1 < e2:
buy = money // e1
money -= buy * e1
stock += buy
else:
money += stock * e1
stock = 0
print(money)
| p02603 |
N=int(eval(input()))
ls=[int(s) for s in input().split()]
money=1000
stock=0
for i in range(N-1):
if ls[i]<ls[i+1]:
while money>=ls[i]:
money-=ls[i]
stock+=1
elif ls[i]>ls[i+1]:
money+=ls[i]*stock
stock=0
money+=ls[N-1]*stock
print(money) | N=int(eval(input()))
ls=[int(s) for s in input().split()]
money=1000
stock=0
for i in range(N-1):
if ls[i]<ls[i+1]:
s=money//ls[i]
money-=s*ls[i]
stock+=s
elif ls[i]>ls[i+1]:
money+=ls[i]*stock
stock=0
money+=ls[N-1]*stock
print(money) | p02603 |
N = int(eval(input()))
A = list(map(int, input().split()))
M = 1000
S = 0
for i in range(N-1):
if A[i] < A[i+1]:
S = M // A[i]
M = M % A[i] + S*A[i+1]
S = 0
else:
pass
print(M) | # DP法でトライ
N = int(eval(input()))
A = list(map(int, input().split()))
# i 日目に、株の売却が終了した時点の所持金の最大値
dp = [0]*N
dp[0] = 1000
for i in range(1,N):
for j in range(0,i):
dp[i] = max(dp[i], dp[i-1],(dp[j]//A[j])*A[i]+dp[j]%A[j])
print((dp[-1])) | p02603 |
INF=10**30
N=int(eval(input()))
A=list(map(int,input().split()))
s=sum(A)
dp=[[-INF]*(s+1) for i in range(N+1)]
dp[0][0]=1000
for i in range(N):
for j in range(s+1):
if dp[i][j]==-INF:
continue
for x in range(j+1):
dp[i+1][j-x]=max(dp[i+1][j-x],dp[i][j]+A[i]*x)
... | N=int(eval(input()))
A=list(map(int,input().split()))
money=1000;kabu=0
i=0
while(i<N):
j=i
money,kabu=money-(money//A[i])*A[i],kabu+(money//A[i])
while(j<N-1 and A[j]<=A[j+1]):
j+=1
money=money+kabu*A[j]
kabu=0
i=j+1
print(money) | p02603 |
def main():
n = int(eval(input()))
A = list(map(int, input().split()))
ans = 1000
t, p = [], []
if A[0] < A[1]:
t.append(0)
for i in range(1, n - 1):
if A[i - 1] >= A[i] < A[i + 1]:
t.append(i)
elif A[i - 1] <= A[i] > A[i + 1]:
p.append(... | def main():
n = int(eval(input()))
A = list(map(int, input().split()))
ans, b = 1000, 0
def buy(a):
nonlocal b, ans
b += ans // a
ans %= a
def sell(a):
nonlocal b, ans
ans += b * a
b = 0
if A[0] < A[1]: buy(A[0])
for i in range(1, ... | p02603 |
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
n = ni()
a = nl()
ans = 0
for i in range(2**n):
mo = 1000
st = 0
for j in range(n):
if ((i>>j) & 1):
s = mo//a[j]
st += s
mo -=a[j]*s
else:
m... | ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
n = ni()
a = nl()
dp=[0]*(n+1)
dp[0] = 1000
for i in range(1,n):
dp[i]=dp[i-1]
for j in range(i):
v = dp[j] // a[j]
w = dp[j] + (a[i]-a[j])*v
dp[i] = max(dp[i],w)
... | p02603 |
import sys
k=1000
N=int(eval(input()))
L=list(map(int,input().split()))
i=0
while i<N-1:
if L[i]<L[i+1]:
n=L[i]
break
i+=1
if i==N-1:
print((1000))
sys.exit()
n=0
for j in range(i,N):
if j==N-1 and n!=0:
m=max(L[s:])
c=k%n
k=((k//n)*m)+c
n=0
break
if j=... | n = int(eval(input()))
a = list(map(int, input().split()))
money = 1000
kabu = 0
for i in range(n-1):
if a[i] < a[i+1] and money != 0:
kabu += money // a[i]
money -= a[i] *(money // a[i])
elif a[i] > a[i+1] and kabu != 0:
money += a[i] * kabu
kabu = 0
print((money + a[... | p02603 |
from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
d = defaultdict(lambda: 0)
d[0] = 1000
for i in range(N):
dd = d.copy()
for s,m in list(dd.items()):
temp = m//A[i]
for j in range(1,temp+1):
if(d[s+j]<m-j*A[i]):
... | N = int(eval(input()))
A = list(map(int, input().split()))
m=1000
s=0
for i in range(N-1):
if A[i] < A[i+1]:
s+=m//A[i]
m=m%A[i]
if A[i] > A[i+1]:
m += A[i]*s
s=0
print((m+A[N-1]*s))
| p02603 |
#bottomかtopか
n=int(eval(input()))
a=list(map(int,input().split()))
an=[]
for i in range(1,n):
if a[i]>a[i-1]:
an.append(a[i-1])
if i==n-1:
an.append(a[i])
break
pm=0
for j in range(i+1,n):
#print(pm)
if pm==0:
if a[j]>=a[j-1]:
if j==n-1:... | n=int(eval(input()))
a=list(map(int,input().split()))
dp=[0]*n
dp[0]=1000
for i in range(1,n):
dp[i]=dp[i-1]
for j in range(i):
dp[i]=max(dp[i],(dp[j]//a[j])*a[i]+dp[j]%a[j])
print((dp[n-1])) | p02603 |
import collections
N=int(eval(input()))
A=list(map(int,input().split()))
i=0
A.insert(0,float("inf"))
#print(A)
buy=[0]*N
sell=[0]*N
for i in range(N-1):
if (A[i]>=A[i+1])and(A[i+2]>=A[i+1]):
buy[i]=1
if (A[i]<=A[i+1])and(A[i+2]<=A[i+1]):
sell[i]=1
kabu=0
money=1000
#print(buy,sel... | import collections
N=int(eval(input()))
A=list(map(int,input().split()))
i=0
A.insert(0,float("inf"))
#print(A)
buy=[0]*N
sell=[0]*N
for i in range(N-1):
if (A[i]>=A[i+1])and(A[i+2]>=A[i+1]):
buy[i]=1
if (A[i]<=A[i+1])and(A[i+2]<=A[i+1]):
sell[i]=1
kabu=0
money=1000
#print(buy,sel... | p02603 |
import sys
sys.setrecursionlimit(10**9)
def mi(): return list(map(int,input().split()))
def ii(): return int(eval(input()))
def isp(): return input().split()
def deb(text): print(("-------\n{}\n-------".format(text)))
INF=10**20
def main():
N=ii()
A=list(mi()) + [0]
dp = [[0] * (2*10**5+10) ... | import sys
sys.setrecursionlimit(10**9)
def mi(): return list(map(int,input().split()))
def ii(): return int(eval(input()))
def isp(): return input().split()
def deb(text): print(("-------\n{}\n-------".format(text)))
INF=10**20
def main():
N=ii()
_A=list(mi())
A = []
for a in _A:
... | p02603 |
#!/usr/bin/env python
n = int(eval(input()))
given_a = list(map(int, input().split()))
a = []
for k in given_a:
if len(a) > 0 and a[-1] == k:
continue
else:
a.append(k)
money = 1000
kabu = 0
n = len(a)
if n == 1:
print(money)
exit()
for i in range(n):
if i ... | #!/usr/bin/env python
n = int(eval(input()))
a = list(map(int, input().split()))
money = 1000
kabu = 0
for i in range(n-1):
s = a[i]
t = a[i+1]
if s < t:
k = money//s
money %= s
money += k*t
print(money)
| p02603 |
import sys
def solve():
input = sys.stdin.readline
I, O, T, J, L, S, Z = list(map(int, input().split()))
#I * 2: 4; O * 1: 2, J, L * 2: 4, I + J + L: 6
Ans = O * 2
six = min([I, J, L])
Ans += six * 6
I -= six
J -= six
L -= six
Ans += 4 * (I // 2 + J // 2 + L // 2)
... | import sys
def solve():
input = sys.stdin.readline
I, O, T, J, L, S, Z = list(map(int, input().split()))
Ans = O
six = min([I, J, L])
Ans += 3 * six
I -= six
J -= six
L -= six
Ans += 2 * (I // 2 + J // 2 + L // 2)
rem = I % 2 + J % 2 + L % 2
if six > 0 and rem =... | p03840 |
i,o,t,j,l,s,z=list(map(int,input().split()))
a=(i//2+j//2+l//2)*2
print(([a,max(a,((i-1)//2+(j-1)//2+(l-1)//2)*2+3)][(i and j and l)>0]+o)) | I,O,T,J,L,S,Z=list(map(int,input().split()))
print((max((~-I//2+~-J//2+~-L//2)*2+O+3*(I>0<L>0<J),(I//2+J//2+L//2)*2+O))) | p03840 |
I,O,T,J,L,S,Z=list(map(int,input().split()))
print((max((~-I//2+~-J//2+~-L//2)*2+O+3*(I>0<L>0<J),(I//2+J//2+L//2)*2+O))) | I,O,T,J,L,S,Z=list(map(int,input().split()))
print((max((~-I//2+~-J//2+~-L//2)*2+3*(I>0<L>0<J),I//2+J//2+L//2<<1)+O)) | p03840 |
import sys
readline = sys.stdin.readline
def popcount(i):
assert 0 <= i < 0x100000000
i = i - ((i >> 1) & 0x55555555)
i = (i & 0x33333333) + ((i >> 2) & 0x33333333)
return (((i + (i >> 4) & 0xF0F0F0F) * 0x1010101) & 0xffffffff) >> 24
Jm = 18
MOD = 10**18+3
def frac(limit):
frac = [1]... | import sys
readline = sys.stdin.readline
def popcount(i):
i = i - ((i >> 1) & 0x55555555)
i = (i & 0x33333333) + ((i >> 2) & 0x33333333)
return (((i + (i >> 4) & 0xF0F0F0F) * 0x1010101) & 0xffffffff) >> 24
Jm = 18
MOD = 10**18+3
def frac(limit):
frac = [1]*limit
for i in range(2,limi... | p02649 |
def popcount_parity(x):
for i in range(8):
x ^= x >> (1 << i)
return -1 if x & 1 else 1
N, K, S, T = list(map(int, input().split()))
if S & T != S:
print((0))
exit()
C = [[1]]
CC = [0] * 51
for i in range(1, 51):
C.append([1] * (i + 1))
for j in range(1, i):
C[i]... | def popcount_parity(x):
x ^= x >> 1
x ^= x >> 2
x ^= x >> 4
x ^= x >> 8
x ^= x >> 16
return -1 if x & 1 else 1
N, K, S, T = list(map(int, input().split()))
if S & T != S:
print((0))
exit()
C = [[1]]
CC = [0] * 51
for i in range(1, 51):
C.append([1] * (i + 1))
f... | p02649 |
tmp = list(input().split())
H = int(tmp[0])
N = int(tmp[1])
tmp = list(input().split())
sum = 0
for i in range (N) :
sum += int(tmp[i])
print(('Yes' if sum >= H else 'No')) | H,N= list(map(int,input().split()))
A=list(map(int,input().split()))
x=0
for i in range(N):
x=x+A[i]
if x>=H:
print("Yes")
else:
print("No") | p02784 |
H,N= list(map(int,input().split()))
A=list(map(int,input().split()))
x=0
for i in range(N):
x=x+A[i]
if x>=H:
print("Yes")
else:
print("No") | hn = list(map(int,input().split()))
h,n = hn
a = list(map(int,input().split()))
h -= sum(a)
if h > 0:
print ("No")
else:
print ("Yes") | p02784 |
h, n = list(map(int, input().split()))
a = [int(x) for x in input().split()]
h -= sum(a)
if h <= 0:
print('Yes')
else:
print('No')
| def can_win_without_repeated_move(health, special_moves_damages) -> str:
"""
Given a monster's health and a number of special moves with differ damages,
can we deplete the monster's health without repeating the same move twice?
:param health: int
:param special_moves_damages: list[int]
:... | p02784 |
h,n = list(map(int,input().split()))
A = list(map(int,input().split()))
print(('Yes' if sum(A)>=h else 'No'))
| h,n=list(map(int,input().split()))
A=list(map(int,input().split()))
print(('Yes' if h<=sum(A) else 'No'))
| p02784 |
H, N = [int(x) for x in input().split()]
attacks = [int(x) for x in input().split()]
print(("Yes" if H - sum(attacks) <= 0 else "No")) | H,N= list(map(int, input().split()))
AList = list(map(int,input().split()))
if sum(AList)>=H:
print("Yes")
else:
print("No") | p02784 |
import sys
input = sys.stdin.readline
H, N = list(map(int, input().split()))
a = list(map(int, input().split()))
if sum(a) >= H:
print("Yes")
else: print("No") | import sys
input = sys.stdin.readline
H, N = list(map(int, input().split()))
sm = sum(list(map(int, input().split())))
if H <= sm: print("Yes")
else: print("No") | p02784 |
a,b=list(map(int,input().split()))
c=[int(x) for x in input().split()]
se=set()
import itertools
ok=False
for j in range(b):
for i in itertools.permutations(c,r=j+1):
if sum(i)>=a:
ok=True
break
if ok:
break
if ok:
print("Yes")
else:
print("No") | a,b=list(map(int,input().split()))
c=[int(x) for x in input().split()]
if sum(c)>=a:
print("Yes")
else:
print("No") | p02784 |
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
for i in range(N):
H -= A[i]
print(("Yes" if H <= 0 else "No")) | H, N = list(map(int, input().split()))
A = [int(x) for x in input().split()]
print(("Yes" if H <= sum(A) else "No")) | p02784 |
H, N = list(map(int, input().split()))
A = [int(x) for x in input().split()]
print(("Yes" if H <= sum(A) else "No")) | h,n = list(map(int, input().split()))
A = list(map(int, input().split()))
print(("Yes" if sum(A)>=h else "No")) | p02784 |
data = [int(_) for _ in input().split()]
num = [int(_) for _ in input().split()]
if sum(num) < data[0]:
print("No")
else:
print("Yes") | data = [int(_) for _ in input().split()][0]
num = sum([int(_) for _ in input().split()])
if num < data:
print("No")
else:
print("Yes") | p02784 |
# モンスターの体力は H
# アライグマは N 種類の必殺技を使うことができ
# i番目の必殺技を使うとモンスターの体力を Ai 減らすことができます。
# モンスターの体力を0以下にすれば、アライグマ勝ち
# アライグマが同じ必殺技を 2 度以上使うことなくモンスターに勝つことができるなら Yes を、
# できないなら No を出力してください。
H, N = list(map(int, input().split()))
data = list(map(int, input().split()))
if H - sum(data) > 0:
print('No')
else:
p... | # モンスターの体力は H
# アライグマは N 種類の必殺技を使うことができ
# i番目の必殺技を使うとモンスターの体力を Ai 減らすことができます。
# モンスターの体力を0以下にすれば、アライグマ勝ち
# アライグマが同じ必殺技を 2 度以上使うことなくモンスターに勝つことができるなら Yes を、
# できないなら No を出力してください。
H, N = list(map(int, input().split()))
data = list(map(int, input().split()))
sum = sum(data)
if H - sum > 0:
print('No')
e... | p02784 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.