Problem:


Score: 300 points

Problem Statement

In 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!

There are five means of transport in this empire:

Train: travels from City 1 to 2 in one minute. A train can occupy at most A people.

Bus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.

Taxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.

Airplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.

Ship: travels from City 5 to 6 in one minute. A ship can occupy at most E people.

For each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).

There is a group of N people at City 1, and they all want to go to City 6.

At least how long does it take for all of them to reach there? 
You can ignore the time needed to transfer.  

Constraints

1 \leq N, A, B, C, D, E \leq 10^{15}

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A
B
C
D
E

Output

Print the minimum time required for all of the people to reach City 6, in minutes.

Sample Input 1

5
3
2
4
3
5

Sample Output 1

7

One possible way to travel is as follows.
First, there are N = 5 people at City 1, as shown in the following image:

In the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.

In the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.

In the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.

From then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.

There is no way for them to reach City 6 in 6 minutes or less.

Sample Input 2

10
123
123
123
123
123

Sample Output 2

5

All kinds of vehicles can occupy N = 10 people at a time.
Thus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.  

Sample Input 3

10000000007
2
3
5
7
11

Sample Output 3

5000000008

Note that the input or output may not fit into a 32-bit integer type.



Sample input:
5
3
2
4
3
5


Sample output:
7

Submission status: Wrong Answer

Solution code:
N = int(input())
tr = [int(input()) for i in range(5)]
s = -(-N // tr[0]) - 1
cnt = 5 + s
for i in range(1, 5):
    # print(cnt, s,(-(-N // tr[i]) - (s + 1)))
    if (-(-N // tr[i]) - (s + i)) >= 0:
        cnt += (-(-N // tr[i]) - (s + 1))
print(cnt)

Submission status: Wrong Answer

Solution code:
n, *wait = [int(input()) for i in range(6)]
print(wait)

minutes = 0
clash = n

for i in range(5):
    if clash > 0:
        minutes += clash // wait[i]
    clash = n % wait[i]

print(minutes + 5)

Submission status: Wrong Answer

Solution code:
N = int(input())
tr = [int(input()) for i in range(5)]
s = -(-N // tr[0]) - 1
cnt = 5 + s
for i in range(1, 5):
    # print(cnt, s,(-(-N // tr[i]) - (s + 1)))
    if (-(-N // tr[i]) - (s + 1)) >= 0:
        cnt += (-(-N // tr[i]) - (s + 1))
print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())
tr = [int(input()) for i in range(5)]
s = -(-N // tr[0]) - 1
cnt = 5 + s
for i in range(1, 5):
    # print(cnt, s,(-(-N // tr[i]) - (s + 1)))
    if (-(-N // tr[i]) - (s + 1)) > 0:
        cnt += (-(-N // tr[i]) - (s + 1))
print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())
tr = [int(input()) for i in range(5)]
s = -(-N // tr[0]) - 1
cnt = 5 + s
for i in range(1, 5):
    if (-(-N // tr[i]) - (s + 1)) > 0:
        cnt += s
print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())

lst_A = []

for i in range(5):
    lst_A.append(input())
    lst_A[i] = int(lst_A[i])

lst_A.sort()

print(lst_A)

ans = N // lst_A[0]

if N % lst_A[0]:

    ans += 1

ans += 4

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import os

N=int(input())
p=[0]*5
for i in range(5):
    p[i]=int(input())

pmin=min(p)
#g=math.ceil(N/pmin)
g=int(N/pmin)
print(5+g)

Submission status: Wrong Answer

Solution code:
N, *x = map(int, open(0))
print(5 - (-N // min(x)))

Submission status: Wrong Answer

Solution code:
N, *x = map(int, open(0))
print(5 + (N // min(x)))

Submission status: Wrong Answer

Solution code:
N = int(input())
x = [int(input()) for _ in range(5)]
print(len(x) + (N // min(x)))

Submission status: Wrong Answer

Solution code:
n,a,b,c,d,e = [int(input()) for i in range(6)]
print(n//min(a,b,c,d,e)+5)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys
import math

input = sys.stdin.readline

def main():
    n = int(input())
    e = int(input())
    time = math.ceil(n / e)
    prev = e

    for _ in range(4):
        e = int(input())
        if prev > e:
            add_num = (prev - e) * time
            time += int(math.ceil(add_num / e))
        else:
            time += 1
        prev = e
    print(time)

main()

Submission status: Wrong Answer

Solution code:
trans = []
for i in range(6):
    trans.append(int(input()))

delay = 0
bottle_neck = trans[0]
for i in range(1,6):
    if bottle_neck > trans[i]:
        delay += int(bottle_neck / trans[i])
        bottle_neck = trans[i]

print(delay+5)

Submission status: Wrong Answer

Solution code:
trans = []
for i in range(6):
    trans.append(int(input()))

delay = 0
bottle_neck = trans[0]
for i in range(1,6):
    if bottle_neck > trans[i]:
        delay += int(bottle_neck / trans[i])
        bottle_neck = trans[i]

print(delay)

Submission status: Wrong Answer

Solution code:
# import math
n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())

min = min(a, b, c, d, e)
ans = (n-1)//min + 5
# ans = ceil(n/min)+4
print(min, ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())

min = min(a, b, c, d, e)
ans = n//min + 5

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
transport = [int(input()) for x in range(0,5)]

trans_min_index = transport.index(min(transport))
time = 5-1 + int(n/transport[trans_min_index] + 1)

print(time)

Submission status: Wrong Answer

Solution code:
c = [0] * 6
data = [0] * 6
for i in range(6):
    data[i] = input()

n, a, b, C, d, e = list(map(int, data))

if n % min(a,b,C,d,e) != 0:
    score = (n // min(a,b,C,d,e)) + 1
else:
    score = n / min(a,b,C,d,e)
ans = score +4
print(ans)

"""
c[0] = n
count = 0
print(n,a,b,C,d,e)
tem = [0] * 6
while c[5] != n:
    count += 1
    print(c)
    if c[0] == 0:
        pass
    elif c[0] <= a:
        tem[1] += c[0]
        c[0] = 0
    else:
        c[0] -= a
        tem[1] += a

    if c[1] == 0:
        pass
    elif c[1] <= b:
        tem[2] += c[1]

    else:
        c[1] -= b
        tem[2] += b

    if c[2] == 0:
        pass
    elif c[2] <= C:
        tem[3] += c[2]
        c[2] = 0
    else:
        c[2] -= C
        tem[3] += C
    
    if c[3] == 0:
        pass
    elif c[3] <= d:
        tem[4] += c[3]
        c[3] = 0
    else:
        c[3] -= d
        tem[4] += d

    if c[4] == 0:
        pass
    elif c[4] <= e:
        tem[5] += c[4]
        c[4] = 0
    else:
        c[4] -= e
        tem[5] += e
    for i in range(1,6):
        c[i] += tem[i]
        tem[i] = 0
    
print(count)
"""

Submission status: Wrong Answer

Solution code:
c = [0] * 6
data = [0] * 6
for i in range(6):
    data[i] = input()
print(data)
n, a, b, C, d, e = list(map(int, data))

if n % min(a,b,C,d,e) != 0:
    score = (n // min(a,b,C,d,e)) + 1
else:
    score = n / min(a,b,C,d,e)
ans = score +4
print(ans)

"""
c[0] = n
count = 0
print(n,a,b,C,d,e)
tem = [0] * 6
while c[5] != n:
    count += 1
    print(c)
    if c[0] == 0:
        pass
    elif c[0] <= a:
        tem[1] += c[0]
        c[0] = 0
    else:
        c[0] -= a
        tem[1] += a

    if c[1] == 0:
        pass
    elif c[1] <= b:
        tem[2] += c[1]

    else:
        c[1] -= b
        tem[2] += b

    if c[2] == 0:
        pass
    elif c[2] <= C:
        tem[3] += c[2]
        c[2] = 0
    else:
        c[2] -= C
        tem[3] += C
    
    if c[3] == 0:
        pass
    elif c[3] <= d:
        tem[4] += c[3]
        c[3] = 0
    else:
        c[3] -= d
        tem[4] += d

    if c[4] == 0:
        pass
    elif c[4] <= e:
        tem[5] += c[4]
        c[4] = 0
    else:
        c[4] -= e
        tem[5] += e
    for i in range(1,6):
        c[i] += tem[i]
        tem[i] = 0
    
print(count)
"""

Submission status: Wrong Answer

Solution code:
N = int(input())
x =[int(input()) for _ in range(5)]

if N < min(x):
    print(5)
else:
    print(str(round(N / min(x)+0.5) + 4))

Submission status: Wrong Answer

Solution code:
n=int(input())
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())

m = min(a, b, c, d, e)
print(int(n/m) + 5)

Submission status: Wrong Answer

Solution code:
def sub():
    items = [int(input()) for _ in range(6)]
    N = int(items[0])
    ds = [int(e) for e in items[1:]]
    k = min(ds)
    
    nb_pack, _ = divmod(N, k)
    # if k != 0:
    #     nb_pack = nb_pack + 1
    wait = nb_pack - 1 + 5
    print(wait)

sub()

Submission status: Wrong Answer

Solution code:
def sub():
    items = [int(input()) for _ in range(6)]
    N = int(items[0])
    ds = [int(e) for e in items[1:]]
    k = min(ds)
    
    nb_pack, _ = divmod(N, k)
    if k != 0:
        nb_pack = nb_pack + 1
    wait = nb_pack - 1 + 5
    print(wait)

sub()

Submission status: Wrong Answer

Solution code:
import math

def sub():
    items = [int(input()) for _ in range(6)]
    N = int(items[0])
    ds = [int(e) for e in items[1:]]
    k = min(ds)

    nb_pack = math.floor(N / k)
    print(nb_pack + 5)

sub()

Submission status: Wrong Answer

Solution code:
from sys import stdin


def solve(nums):
    num_person, *caps = nums
    return 5 + num_person // min(*caps)


def main():
    nums = [int(l) for l in stdin.readlines()]
    ans = solve(nums)
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [int(input()) for i in range(5)]
print(5 + n // min(l))

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
l = []
for _ in range(5):
    l.append(int(input()))

print(5 + math.ceil((N//min(l))))

Submission status: Wrong Answer

Solution code:
N = int(input())
l = []
for _ in range(5):
    l.append(int(input()))

print(4 + (N+1)//min(l))

Submission status: Wrong Answer

Solution code:
N = int(input())
l = []
for _ in range(5):
    l.append(int(input()))

print(len(l) + N //min(l))

Submission status: Wrong Answer

Solution code:
import math

n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())

stops = [a, b, e, d, e]

stop = min(stops)

answer = math.ceil(n/stop) + 4
print(answer)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())

stops = [a, b, e, d, e]

stop = min(stops)

answer = int(n / stop) + 5
print(answer)

Submission status: Wrong Answer

Solution code:
N =int(input())
A =int(input())
B =int(input())
C =int(input())
D =int(input())
E =int(input())
X =min(A,B,C,D,E)
print(N//X + 5)

Submission status: Wrong Answer

Solution code:
n = [int(input()) for i in range(5)]
t = int(input())

m = min(n)

if t < m:
    t = m

tmp = t//m

if t % m != 0:
    tmp += 1

print(tmp+4)

Submission status: Wrong Answer

Solution code:
N = int(input())                                                                                                                                             
CN = 6                                                                                                                                                       
                                                                                                                                                             
TC = [0] * (CN-1)                                                                                                                                            
for i in range(CN-1):                                                                                                                                        
    TC[i] = int(input())                                                                                                                                     
                                                                                                                                                             
                                                                                                                                                             
time = CN - 1                                                                                                                                                
                                                                                                                                                             
min_TC = N                                                                                                                                                   
for i in range(CN-1):                                                                                                                                        
    if TC[i] < min_TC:                                                                                                                                       
        time = time + min_TC//TC[i]                                                                                                                          
        min_TC = TC[i]                                                                                                                                       
                                                                                                                                                             
print(time)

Submission status: Wrong Answer

Solution code:
N = int(input())                                                                                                                                             
CN = 6                                                                                                                                                       
                                                                                                                                                             
TC = [0] * (CN-1)                                                                                                                                            
for i in range(CN-1):                                                                                                                                        
    TC[i] = int(input())                                                                                                                                     
                                                                                                                                                             
                                                                                                                                                             
time = CN - 1                                                                                                                                                
                                                                                                                                                             
min_TC = N                                                                                                                                                   
for i in range(CN-1):                                                                                                                                        
    if TC[i] < min_TC:                                                                                                                                       
        min_TC = TC[i]                                                                                                                                       
        time = time + min_TC//TC[i]                                                                                                                          
                                                                                                                                                             
print(time)

Submission status: Wrong Answer

Solution code:
N = int(input())                                                                                                                                             
CN = 6                                                                                                                                                       
                                                                                                                                                             
TC = [0] * (CN-1)                                                                                                                                            
for i in range(CN-1):                                                                                                                                        
    TC[i] = int(input())                                                                                                                                     
                                                                                                                                                             
                                                                                                                                                             
time = CN - 1                                                                                                                                                
                                                                                                                                                             
min_TC = N                                                                                                                                                   
for i in range(CN-1):                                                                                                                                        
    if TC[i] < min_TC:                                                                                                                                       
        min_TC = TC[i]                                                                                                                                       
        time = time + N//TC[i]                                                                                                                               
                                                                                                                                                             
print(time)

Submission status: Wrong Answer

Solution code:
N = int(input())
S = [input() for i in range(5)]

if int(min(S)) >= N:
  print(5)
else:
  if N % int(min(S)) == 0:
    print(int(N//int(min(S))) + 4 )
  else:
    print(int(N//int(min(S))) + 5 )

Submission status: Wrong Answer

Solution code:
N,A,B,C,D,E =[int(input()) for _ in [0]*6]
M = min(A,B,C,D,E)
print(N//M+ 5 if N%M else 4)

Submission status: Wrong Answer

Solution code:
import numpy as np
import math
li = []
n=np.log10(int(input()))
for i in range(5):
    k = np.log10(int(input()))
    li.append(k)
li.sort()
g = math.ceil(10**(n-li[0]))
print(g+4)

Submission status: Wrong Answer

Solution code:
import numpy as np
li = []
n=np.log10(int(input()))
for i in range(5):
    k = np.log10(int(input()))
    li.append(k)
li.sort()
if 10**(n-li[0])-int(10**(n-li[0]))<10**(-15):
    g=int(10**(n-li[0]))
else:
    g=int(10**(n-li[0]))+1
print(g+4)

Submission status: Wrong Answer

Solution code:
import numpy as np
li = []
n=np.log10(int(input()))
for i in range(5):
    k = np.log10(int(input()))
    li.append(k)
li.sort()
if 10**(n-li[0])-int(10**(n-li[0]))<10**(-5):
    g=10**(n-li[0])
else:
    g=int(10**(n-li[0]))+1
print(g+4)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())

transport = [A, B, C, D, E]
bottleneck = min(transport)
time = 0
reached = 0

time = N // bottleneck + 5

print(time)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())

row=[a,b,c,d,e]
cnt=0
if n<=min(row):
    cnt=0
else:
    cnt=n//min(row)

print(cnt+5)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())

row=[a,b,c,d,e]
cnt=0
if n<=min(row):
    cnt=1
else:
    cnt=n//min(row)+1

print(cnt+4)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())

row=[a,b,c,d,e]
cnt=0
if n<min(row):
    cnt=1
else:
    cnt=n//min(row)+1

print(cnt+4)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(input()) for _ in range(5)]

ans = n // min(a) + 5
print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Mon May 13 13:29:57 2019

@author: avina
"""

n= int(input())
l = []
for i in range(5):
    l.append(int(input()))
k = min(l)
o = l.index(k)
sums = 0
for i in range(o+1,4):
    if l[i+1] < l[i]:
        if l[i+1]%l[i] != 0:
            sums+= l[i]//l[i+1]+1
        else:
            sums += l[i]//l[i+1]
if o == 0:
    sums += 5 
else:
    sums += 5 - o -1
print(sums + n//k )

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Mon May 13 13:29:57 2019

@author: avina
"""

n= int(input())
l = []
for i in range(5):
    l.append(int(input()))
k = min(l)
o = l.index(k)
sums = 0
for i in range(o+1,4):
    if l[i+1] < l[i]:
        if l[i+1]%l[i] != 0:
            sums+= l[i]//l[i+1]+1
        else:
            sums += l[i]//l[i+1]
sums += (5 - o -1)
print(sums + n//k )

Submission status: Wrong Answer

Solution code:
from math import ceil

n = int(input())
l = [int(input()) for _ in range(5)]

print(ceil(n%min(l)) + 4)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [int(input()) for i in range(5)]

index = 0
v = l[0]
for i in range(len(l)):
    if l[i] < v:
        index = i
        v = l[i]

result = index + n // v + len(l) - index
print(result)

Submission status: Wrong Answer

Solution code:
def count(inA, inB, before, total):
  if inB >= inA:
    count = before
  else:
    if inA%inB==0:
      count = total / inB
    else:
      count = int(total / inB) + 1
  
  return count

num = []
num.append(int(input()))
num.append(int(input()))
num.append(int(input()))
num.append(int(input()))
num.append(int(input()))
num.append(int(input()))

total_count = 0
for i in range(0, len(num)-1):
  if i==0:
    total_count = count(num[0], num[i+1], 1, num[0])
  else:
    total_count = count(min(num[1:i+1]), num[i+1], total_count, num[0])

print(total_count + 4)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())
print((N//min(A,B,C,D,E))+5)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())

print(N // min(A,B,C,D,E) + 5)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())
m = min(A, B, C, D, E)
if N % m == 0:
    print(N // m)
else:
    print(N // m + 1)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())

m = min(a, b, c, d, e)

if m >= n:
    cnt = 1
elif n % m != 0:
    cnt = n / m + 1
else:
    cnt = n / m

print(cnt + 4)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())

m = min(a, b, c, d, e)

if m >= n:
    cnt = 1
elif m % n != 0:
    cnt = n // m + 1
else:
    cnt = n // m

print(cnt + 4)

Submission status: Wrong Answer

Solution code:
N = int(input())

#各都市に行くためのコスト
lift = [int(input()) for i in range(5)]
#各都市にいる人数
city = [0] * 6
city[0] = N

ans = 0
target = []

while 1:
    if city[5] == N:
        break
    for i in range(0,5):
        #今回の操作で動かすもの一覧を作る（i-1に値があるものだけ動かす)
        if city[i] != 0:
            target.append(i+1)
    for i in reversed(target):
        if city[i-1] >= lift[i-1]:
            city[i] += lift[i-1]
            city[i - 1] -= lift[i-1]
        else:
            city[i] += city[i-1]
            city[i-1] = 0
    target = []
    ans += 1
    print(city)
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())

line = [a, b, c, d, e]
min = min(line)

print(n//min + 5)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())

mn = min(N,A,B,C,D,E)
print((N // mn) + 5)

Submission status: Wrong Answer

Solution code:
n=int(input())
c=list(map(int,[input() for _ in range(5) ]))

if n>min(c):
    print(n//min(c)+5)
else:
    print(5)

Submission status: Wrong Answer

Solution code:
n=int(input())
c=list(map(int,[input() for _ in range(5) ]))

if n>min(c):
    print(n//min(c)+4+c.count(min(c)))
else:
    print(5)

Submission status: Wrong Answer

Solution code:
n=int(input())
c=list(map(int,[input() for _ in range(5) ]))

if n!=min(c):
    print(n//min(c)+4+c.count(min(c)))
else:
    print(5)

Submission status: Wrong Answer

Solution code:
n=int(input())
c=list(map(int,[input() for _ in range(5) ]))

if n!=min(c):
    print(n//min(c)+4+c.count(min(c)))
else:
    print(5)

print(min)

Submission status: Wrong Answer

Solution code:
n=int(input())
c=list(map(int,[input() for _ in range(5) ]))

if n!=min:
    print(n//min(c)+4+c.count(min(c)))
else:
    print(5)

Submission status: Wrong Answer

Solution code:
n=int(input())
c=list(map(int,[input() for _ in range(5) ]))

if n!=min(c):
    print(5+n//min(c))
else:
    print(5)

Submission status: Wrong Answer

Solution code:
n=int(input())
c=list(map(int,[input() for _ in range(5) ]))

print(5+n//min(c))

Submission status: Wrong Answer

Solution code:
N=int(input())
A=int(input())
B=int(input())
C=int(input())
D=int(input())
E=int(input())

print(5+N//A+A//B+B//C+C//D+D//E)

Submission status: Wrong Answer

Solution code:
N=int(input())
A=int(input())
B=int(input())
C=int(input())
D=int(input())
E=int(input())

print(5+N//min(A,B,C,D,E))

Submission status: Wrong Answer

Solution code:
n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())

f = min([a,b,c,d,e])
g = int(n/f) + 1
print(5 + g -1)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())

s = (1+n)//min(a,b,c,d,e)
if s==0:
    s = 1
print(5+s-1)

Submission status: Wrong Answer

Solution code:
n = int(input())
buf = []
for i in range(5):
  buf.append(int(input()))
  
print(n // min(buf) + 6 - (n % min(buf) == 0))

Submission status: Wrong Answer

Solution code:
n = int(input())
r = [int(input()) for i in range(5)]
s = min(r)
if n%s is 0:
  n = n/s
else:
  n = n//s + 1
  
print(n+4)

Submission status: Wrong Answer

Solution code:
NUM_TRANSPORTATION = 5

num_total_people = int(input())
nums_transportation_seat = [int(input()) for i in range(NUM_TRANSPORTATION)]

result = 0
if num_total_people != 0:
    result = num_total_people // min(nums_transportation_seat) + 5
    
print(result)

Submission status: Wrong Answer

Solution code:
NUM_TRANSPORTATION = 5

num_total_people = int(input())
nums_transportation_seat = [int(input()) for i in range(NUM_TRANSPORTATION)]

result = num_total_people // min(nums_transportation_seat) + 5
print(result)

Submission status: Wrong Answer

Solution code:
NABCDE = [int(input()) for _ in range(6)]

time = 5
min_capa = NABCDE[0]
for i in range(0,len(NABCDE)-1):
    if min_capa != NABCDE[i+1]:
        time += min_capa // NABCDE[i+1]
    if min_capa > NABCDE[i+1]:
        min_capa = NABCDE[i+1]

print('{}'.format(time))

Submission status: Wrong Answer

Solution code:
NABCDE = [int(input()) for _ in range(6)]

time = 5
min_capa = NABCDE[0]
for i in range(0,len(NABCDE)-1):
    time += min_capa // NABCDE[i+1]
    if min_capa > NABCDE[i+1]:
        min_capa = NABCDE[i+1]

print('{}'.format(time))

Submission status: Wrong Answer

Solution code:

n = int(input())
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
ans = 0
minimum = min(n, a, b, c, d, e)

if a == minimum:
    ans = -(-n//a) + 4
elif b == minimum:
    ans = -(-n//b) + 4
elif c == minimum:
    ans = -(-n//c) + 4
elif d == minimum:
    ans = -(-n//d) + 4
elif e == minimum:
    ans = -(-n//e) + 4
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

n = int(input())
h = []
for i in range(5):
    a = int(input())
    h.append(int(a))

h.sort()
wh = h[0]
wn = int(round((n / wh) + 0.5)) - 1 + 5

print(wn)

Submission status: Wrong Answer

Solution code:
def calculation(passenger: int, transport_number: list):
    timecount = 1
    location = [passenger,0,0,0,0,0]
    transport = transport_number
    while True:
        timecount += 2
        for x in range(len(transport_number)):
            if location[x] < transport[x]:
                location[x+1] += location[x]
                location[x] = 0
            elif location[x] >= transport[x]:
                location[x] -= transport[x]
                location[x+1] += transport[x]

        if location[5] == passenger:
            break

    return timecount

if __name__ == "__main__":
    passenger = int(input())
    transport_number = [int(input()) for i in range(5)]
    # passsenger_transporter = PassengerLocation(passenger=passenger, transport_number=transport_number)
    # print(passsenger_transporter.calculation())
    calculation(passenger=passenger, transport_number=transport_number)