Problem:


Score : 100 points

Problem Statement

We have a grid with H rows and W columns, where all the squares are initially white.

You will perform some number of painting operations on the grid.
In one operation, you can do one of the following two actions:

Choose one row, then paint all the squares in that row black.

Choose one column, then paint all the squares in that column black.

At least how many operations do you need in order to have N or more black squares in the grid?
It is guaranteed that, under the conditions in Constraints, having N or more black squares is always possible by performing some number of operations.

Constraints

1 \leq H \leq 100

1 \leq W \leq 100

1 \leq N \leq H \times W

All values in input are integers.

Input

Input is given from Standard Input in the following format:

H
W
N

Output

Print the minimum number of operations needed.

Sample Input 1

3
7
10

Sample Output 1

2

You can have 14 black squares in the grid by performing the "row" operation twice, on different rows.

Sample Input 2

14
12
112

Sample Output 2

8

Sample Input 3

2
100
200

Sample Output 3

2



Sample input:
3
7
10


Sample output:
2

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

if w > h:
    if n % w == 0:
        print(n // w)
    else:
        print((n // w) + 1)
elif w <= h:
    if n % h == 0:
        print(n // h)
    else:
        print((n // w) + 1)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

if w > h:
    if n % w == 0:
        print(n // w)
    else:
        print((n // w) + 1)
elif w < h:
    if n % h == 0:
        print(n // h)
    else:
        print((n // w) + 1)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))

t=sum(a)
m=10**9
flag=0
for i in range(len(a)-1):
    t-=2*a[i]
    if t<=0 :
        if i==0:
            print(abs(t))
            flag = 1
            break
        else:
            print(min(abs(t+2*a[i]),abs(t)))
            flag=1
            break
if flag==0:
    print(t)

Submission status: Wrong Answer

Solution code:
n, h, w = [int(input()) for i in range(3)]
k = max(h, w)
ans = (n+k-1)//k
print(ans)

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
n = int(input())
t = max(a, b)
print(n + t - 1 / t)

Submission status: Wrong Answer

Solution code:
a = int(input())
b = int(input())
n = int(input())
t = max(a, b)
print(n + t - 1 // t)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
m = int(input())
total = 0
if h < w:
  h,w = w,h
for i in range(w):
  total += h
  if total >= m:
    print(i+1)

Submission status: Wrong Answer

Solution code:
x=int(input())
y=int(input())
z=max(x,y)
print(int(input())//z)

Submission status: Wrong Answer

Solution code:
import sys
H = int(input())
W = int(input())
N = int(input())
X = max(H, W)
Y = min(H, W)
count = 0
total = 0
for i in range(Y):
    total += X
    count += 1
    if count >= N:
        print(count)
        sys.exit()
for i in range(X):
    total += Y
    count += 1
    if count >= N:
        print(count)
        break

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

print(min(-(-H//N), -(-W//N)))

Submission status: Wrong Answer

Solution code:
H=int(input())
W=int(input())
N=int(input())
K=H
if K<W: K=W
sum = 0
ans= 0
for i in range(1,K):
  if sum < N:
    sum += K
    ans = i
print(ans)

Submission status: Wrong Answer

Solution code:
def solve(H, W, N):
    c = 0
    b = 0
    L = max(H, W)
    while b < N:
        b += L
        c += 1
    return c
H = int(input())
W = int(input())
N = int(input())

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())
print(min((h+n-1)//h+1,(w+n-1)//w+1))

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
cnt = 0
ans = 0
while ans < n:
    if h < w:
        ans += w
        w -= 1
    else:
        ans += h
        h -= 1
    cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
cnt = 0
ans = 0
max_num = 0
while ans < n:
    if h < w:
        ans += w
        w -= 1
    else:
        ans += h
        w -= 1
    cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
 
k = int(input())
 
a = (k // (max(h, w) - 1))
print(a + 1)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())

k = int(input())

a = (k // (max(h, w) - 1))
print(a + 1)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
print(min(n//h,n//w))

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())


if N % max(H, W) == 0:
    print(round(N / max(H, W)))
else:
    print(round(N / max(H, W) + 1))

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())


if N % max(H, W) == 0:
    print(N / max(H, W))
else:
    print(round(N / max(H, W) + 1))

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())


if N % max(H, W) == 0:
    print(N / max(H, W))
else:
    print((N / max(H, W)) + 1)

Submission status: Wrong Answer

Solution code:
a = [int(input()) for i in range(2)]
b = int(input())
c = b // max(a)
print(c)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

if h < w:
    if n % w == 0:
        print(n % w)
    else:
        print(n % w + 1)
else:
    if n % h == 0: 
        print(n % h)
    else:
        print(n % h + 1)

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())

ans=0
cnt=0
while cnt < n:
  if h<w:
    cnt+=w
    w-=1
    ans+=1
  else:
    cnt+=h
    h-=1
    ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())

ans=0
cnt=0
while cnt < ans:
  if h<w:
    cnt+=w
    w-=1
    ans+=1
  else:
    cnt+=h
    h-=1
    ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())
print((N // max(H, W) + 1) if N % max(H, W) == 0 else (N // max(H, W)))

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())
print(N // max(H, W) + 1 if N % max(H, W) == 0 else N // max(H, W))

Submission status: Wrong Answer

Solution code:
ans = "123"
print(ans.replace(input(),"").replace(input(),""))

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
if n // max(h,w) == 0:
  print(n // max(h,w))
else:
  print(n // max(h,w) + 1)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
print(n // max(h,w))

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
print(n % max(h,w))

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())
for i in range(min(H,W)):
    N -= max(H, W)
    if N <= 0:
        print(i+1)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
h = max(h, w)
print(n // h)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())
print(N // max(H, W) + 1)

Submission status: Wrong Answer

Solution code:
H=int(input())
W=int(input())
N=int(input())
k=max(H, W)
cnt=0
while k*cnt<=N:
    cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())

if h>w:
  ct=n//h+1
else:
  ct=n//w+1
print(ct)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
if h < w:
    h = w
print(int(n / h) + 1)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())
answer = 0
if H >= W:
    answer = N // H
    if N % H != 0:
        answer += 1
else:
    answer = N // W
    if N % H != 0:
        answer += 1
print(answer)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

print(n//max(h,w)+1)

Submission status: Wrong Answer

Solution code:
H,W,N = [int(input()) for i in range(3)]

print(min(N//H,N//W))

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
l = max([H, W])
N = int(input())
print(N//l+1)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

x = H if H>W else W

print(N//x+ 0 if N%x==0 else 1)

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())

s=max(h,w)
a=n//s+1
print(a)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

print(n // max(h, w) + 1)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

if n % max(h, w) == 0:
	print(n // max(h,w))
elif n % max(h,w) !=0 and n - max(h, w) <= max(h, w):
	print(n // max(h, w) + 1)

Submission status: Wrong Answer

Solution code:
import numpy

Submission status: Wrong Answer

Solution code:
a = 1

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
t = 0

print(max(h,w))

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

print((N+max(H,W)-1)/max(H,W))

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

print(int(N/max(H,W))+1)

Submission status: Wrong Answer

Solution code:
import math
h = int(input())
w = int(input())
n = int(input())
h = max(h,w)
print(math.ceil(h/n))

Submission status: Wrong Answer

Solution code:
a=int(input())
b=int(input())
c=int(input())

d=max(a,b)
ans=0
for i in range(d):
  if d*i>=c:
    print(i)
    exit()

Submission status: Wrong Answer

Solution code:
a,b,c=[int(input()) for i in range(3)]
def main(a,b,c):
    x=max([a,b])
    return int(c/x)+1
main(a,b,c)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

k = max(h, w)

print((n - k + 1) // k)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())
print(N//max(H, W))

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
print(n//max(h,w))

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())

if h>w:
  if (int(n/h))<=w:
    print(int(n/h))
else:
  if (int(n/w))<=h:
    print(int(n/w))

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())

if h>w:
  if (n//h)<=w:
    print(n//h)
else:
  if (n//w)<=h:
    print(n//w)

Submission status: Wrong Answer

Solution code:
H,W,N = [int(input()) for i in range(3)]
for o in range(1,10000):
  if H < W and N / o <= W:
    break
  elif H > W and N / o <= H:
    break
print(o)

Submission status: Wrong Answer

Solution code:
H,W,N = [int(input()) for i in range(3)]
for o in range(1,10000):
  if H < W and N / o <= W:
    break
  if H > W and N / o <= H:
    break
print(o)

Submission status: Wrong Answer

Solution code:
H,W,N = [int(input()) for i in range(3)]
for o in range(1,10000):
  if H < W and  N / o<= W:
    break
  if H> W and N / o<=H:
    break
print(o)

Submission status: Wrong Answer

Solution code:
H,W,N = [int(input()) for i in range(3)]
for o in range(1,10000):
  if H < W and  N / o<= W:
    print(o)
    break
  if H> W and N / o<=H:
    print(o)
    break

Submission status: Wrong Answer

Solution code:
H,W,N = [int(input()) for i in range(3)]
for o in range(1,10000):
  if H < W and  N / o<= W:
    print(o)
    break
  elif H> W and N / o<=H:
    print(o)
    break

Submission status: Wrong Answer

Solution code:
H,W,N = [int(input()) for i in range(3)]
a = N / W
b = N / H
if H < W :
  print(a)
else:
  print(b)

Submission status: Wrong Answer

Solution code:
import sys
H = int(sys.stdin.readline())
W = int(sys.stdin.readline())
N = int(sys.stdin.readline())

print((N - 1) / max(H, W) + 1)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

if(h>w):
  if(n % h == 0):
    print(n//h)
  else:
  	print(n//h + 1)
else:
  if(n % h == 0):
    print(n//w)
  else:
  	print(n//w + 1)

Submission status: Wrong Answer

Solution code:
H, W, N = [int(input()) for _ in range(3)]
print(min((N+H-1)//H, (W+W-1)//W))

Submission status: Wrong Answer

Solution code:
import math

h = int(input())
w = int(input())
n = int(input())

print(math.floor(n / max(h, w)) + 1)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
     
print(n // max(h, w))

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
print(int(n / max(h,w)))

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
m=max(h,w)
x=int(input())

print(x//m)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

print(n//max(h,w))

Submission status: Wrong Answer

Solution code:
input_list = []
for i in range(0, 3):
  input_list.append(int(input()))

h = input_list[0]
w = input_list[1]
n = input_list[2]

temp_num = 0
if w <= h:
  temp_num = h
else:
  temp_num = w

answer = 0
if n % temp_num == 0:
  answer = n / temp_num
else:
  answer = (n // temp_num) + 1
print(answer)

Submission status: Wrong Answer

Solution code:
input_list = []
for i in range(0, 3):
  input_list.append(int(input()))

h = input_list[0]
w = input_list[1]
n = input_list[2]

temp_num = 0
if w <= h:
  temp_num = h
else:
  temp_num = w

answer = 0
if n % temp_num == 0:
  answer = n / temp_num
else:
  answer = (n // temp_num) + 1

Submission status: Wrong Answer

Solution code:
A = [int(input()) for i in range(3)] 
masu_need = A[0]*A[1] - A[2]
a, b = 0, 0
for j in range(min(A[0],A[1])):
  if a < masu_need:
    a = a + max(A[0],A[1])
    b += 1
  else:
    break
print(b)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

if H >= W:
  if N//H != 0:print(N//H + 1)
  else: print(N//H)
else:
  if N//W != 0:print(N//W + 1)
  else: print(N//W)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

if H >= W:
  if N//H != 0:print(N//H + 1)
  else: print(N//H)
else:
  if N//H != 0:print(N//W + 1)
  else: print(N//W)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

if H > W:
  print(N // H)
else:
  print(N // W)

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())
print((n-1)//max(h,w)+2)

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())
print(n//max(h,w)+1)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())
M = max(H, W)
if N % M:
  S = N // M
else:
  S = N // M + 1
print(S)

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())

print(n//max(h,w) +1)

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())

print(n//max(h,w))

Submission status: Wrong Answer

Solution code:
H=int(input())
W=int(input())
N=int(input())
M=max(H,W)
if N/M==N//M:
	print(N/M)
else:
	print(N//M)

Submission status: Wrong Answer

Solution code:
H=int(input())
W=int(input())
N=int(input())
M=max(H,W)
print(N//M+1)

Submission status: Wrong Answer

Solution code:
H=int(input())
W=int(input())
N=int(input())
M=max(H,W)
print(N//M)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

num1 = n/h
num2 = n/w

if not num1.is_integer():
  num1 = int(num1) + 1
  
if not num2.is_integer():
  num2 = int(num2) + 1
  
print(min(num1, num2))

Submission status: Wrong Answer

Solution code:
h=int(input())
n=int(input())
w=int(input())
v=max(h,n)
print(w+v-1//v)

Submission status: Wrong Answer

Solution code:
h=int(input())
n=int(input())
w=int(input())
print(w+max(h,n)-1//max(h,n))

Submission status: Wrong Answer

Solution code:
H=int(input())
W=int(input())
N=int(input())

n = 0
i = 0
j = 0
while n < N:
    n += W - j
    i += 1
    n += H - i
    j += 1

print(j)

Submission status: Wrong Answer

Solution code:
def read():
    h = int(input())
    w = int(input())
    n = int(input())
    return h, w, n


def calc(h, w, n):
    if h > w:
        return int(n / h) + 1
    else:
        return int(n / w) + 1


def main():
    print(calc(*read()))


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
if(h>=w):
    big=h
else:
    big=w
print(int(n/big))

Submission status: Wrong Answer

Solution code:
N = int(input())
M = int(input())
K = int(input())
print(-(-K//M))

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
count=1
if(h>=w):
    big=h
    small=w
else:
    big=w
    small=h
n=n-small
count=count+int(n/(big))
print(count)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

if N % 2 == 0:
  print(N // max(H,W))
else:
  print(N // max(H,W) + 1)

Submission status: Wrong Answer

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
N=int(input())

A=list(map(int,input().split()))

B=list(map(int,input().split()))


def flip(i):
	k=A[i]
	A[i]=B[i+1]
	B[i+1]=k
	l=B[i]
	B[i]=A[i+1]
	A[i+1]=B[i]
	
if A==sorted(A):
	print("0")
else:
	print("-1")

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

print(N // max(H,W))

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = 0
for i in range(10000):
    for i in range(N-1):
        if A == sorted(A):
            print(ans)
            quit()
        a = A[i]
        ai = A[i+1]
        b = B[i]
        bi = B[i+1]
        if b > bi:
            if ai - a >= b - bi:
                A[i] = bi
                A[i+1] = b
                B[i] = ai
                B[i+1] = a
                ans += 1
        elif a > ai:
            if bi - b <= a - ai:
                A[i] = bi
                A[i+1] = b
                B[i] = ai
                B[i+1] = a
                ans += 1
print(-1)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())
 
upper = H if H >= W else W
 
print((N // upper) + 1)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

upper = H if H >= W else W

print((upper // N) + 1)

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())

if h>w:
    ans=n//h+1
else:
    ans=n//w+1

print(ans)

Submission status: Wrong Answer

Solution code:
s = [int(input()) for i in range(3)]
target = s[2]
if s[0] >= s[1]:
  long = s[0]
  short = s[1]
else:
  long = s[1]
  short = s[0]
 
for i in range(short):
  if long * i >= target:
    print(str(i+1))
    break

Submission status: Wrong Answer

Solution code:
H, W, N = map(int, open(0).read().split())
ans = 0

while N >= 0:
  if H < W:
    N -= W
    ans += 1
  elif W < H:
    N -= H
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
import math 

H, W, N = [int(input()) for i in range(3)]

if H >= W:
    long = H
else:
    long = W

c = math.ceil(N // long )

print(c)

Submission status: Wrong Answer

Solution code:
import math

H=int(input())
W=int(input())
N=int(input())

if W>H :
    if N%W==0:
        k=N/W
    else:
        k=math.ceil(N/W)
if H>=W:
    if N%H==0:
        k=N/H
    else:
        k=math.ceil(N/H)


print(k)

Submission status: Wrong Answer

Solution code:
import math
a=input()
b=input()
c=input()
if int(a)>int(b):
 print(math.ceil(int(c)/int(a)))
elif int(a)<int(b):
 print(math.ceil(int(c)/int(b)))

Submission status: Wrong Answer

Solution code:
import math

H=int(input())
W=int(input())
N=int(input())

if W>H :
    if N%W==0:
        k=N/W
    else:
        k=math.ceil(N/W)
else:
    if N%H==0:
        k=N/H
    else:
        k=math.ceil(N/H)


print(k)

Submission status: Wrong Answer

Solution code:
import math
a=input()
b=input()
c=input()
if a>b:
 print(math.ceil(int(c)/int(a)))
elif a<b:
 print(math.ceil(int(c)/int(b)))

Submission status: Wrong Answer

Solution code:
import math

H=int(input())
W=int(input())
N=int(input())

if W>H :
    if N%W==0:
        k=N/W
    else:
        k=math.floor(N/W)+1
else:
    if N%H==0:
        k=N/H
    else:
        k=math.floor(N/H)+1


print(k)

Submission status: Wrong Answer

Solution code:
import math
a=input()
b=input()
c=input()
if a>b:
 print(math.ceil(int(c)/int(b)))
elif a<b:
 print(math.ceil(int(c)/int(b)))

Submission status: Wrong Answer

Solution code:
H=int(input())
W=int(input())
N=int(input())

if W>H :
    if N%W==0:
        k=N/W
    else:
        k=int(N/W)+1
else:
    if N%H==0:
        k=N/H
    else:
        k=int(N/H)+1


print(k)

Submission status: Wrong Answer

Solution code:
import math
c=input()
b=input()
a=input()
if c>b:
        print(math.ceil(int(a)/int(b)))
elif c<b:
        print(math.ceil(int(a)/int(c)))

Submission status: Wrong Answer

Solution code:
import math

H=int(input())
W=int(input())
N=int(input())

if W>H :
    k=math.floor(N/W)
else:
    k=math.floor(H/W)


print(k)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

i = 0
j = 0
if H > W:
    while i < N:
        j = j + 1
        i = (H * j) + i
elif H < W:
    while i < N:
        j = j + 1
        i = (W * j) + i
else:
    while i < N:
        j = j + 1
        i = (H * j) + i
print(j)

Submission status: Wrong Answer

Solution code:
H=int(input())
W=int(input())
N=int(input())

if W>H :
    k=int(N/W)+1
else:
    k=int(H/W)+1


print(k)

Submission status: Wrong Answer

Solution code:
import math
c=input()
b=input()
a=input()
if c>b:
    print(math.ceil(int(a)/int(c)))
else:
    print(math.ceil(int(a)/int(b)))

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

i = 0
j = 1

if H > W:
    while i < N:
        i = (H * j) + i
        j = j + 1
elif H < W:
    while i < N:
        i = (W * j) + i
        j = j + 1
else:
    while i < N:
        i = (H * j) + i
        j = j + 1
print(j-1)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
a = max(h,w)
b = a
count = 0
if h*w == n:
  print(h)
elif b >= n:
  print(1)
else:
 while b <= n:
   b += a
   count += 1
 print(count)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
a = max(h,w)
b = a
count = 0
if h*w == n:
  print(h)
elif b >= a:
  print(1)
else:
 while b <= n:
   b += a
   count += 1
 print(count)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

L = max(H,W)

print((N / L) if N % L == 0 else N // L + 1 )

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())

N = int(input())

boad = [[0] * W for i in range(H)]
n = 0
# boad.pop()
count = 1
j = 1
# print(boad)
if N <= H or N <= W:
    print(1)

elif H < W:

    boad.pop()
    n = W
    while(True):
        
        if n + len(boad[0]) >= N:
            count += 1
            print(count)
            break

        elif n + len(boad) >= N:
            count += 1
            print(count)
            break

        n += W
        boad.pop()

elif W < H:
    W -= 1
    boad = boad = [[0] * W for i in range(H)]
    n = H

    while(True):
        
        if n + len(boad[0]) >= N:
            count += 1
            print(count)
            break

        elif n + len(boad) >= N:
            count += 1
            print(count)
            break

        n += H
        W -= 1
        count += 1
        boad = [[0] * W for i in range(H)]

else:
    boad.pop()
    n = W
    while(True):
        
        if n + len(boad[0]) >= N:
            count += 1
            print(count)
            break

        elif n + len(boad) >= N:
            count += 1
            print(count)
            break

        n += W
        boad.pop()

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())

N = int(input())

boad = [[0] * W for i in range(H)]
n = 0
# boad.pop()
count = 1
j = 1
# print(boad)
if N <= H or N <= W:
    print(1)

elif H < W:

    boad.pop()
    n = W
    while(True):
        
        if n + len(boad[0]) >= N:
            count += 1
            print(count)
            break

        elif n + len(boad) >= N:
            count += 1
            print(count)
            break

        n += W
        boad.pop()

elif W < H:
    print(H)
    W -= 1
    boad = boad = [[0] * W for i in range(H)]
    n = H

    while(True):
        
        if n + len(boad[0]) >= N:
            count += 1
            print(count)
            break

        elif n + len(boad) >= N:
            count += 1
            print(count)
            break

        n += H
        W -= 1
        count += 1
        boad = [[0] * W for i in range(H)]

else:
    boad.pop()
    n = W
    while(True):
        
        if n + len(boad[0]) >= N:
            count += 1
            print(count)
            break

        elif n + len(boad) >= N:
            count += 1
            print(count)
            break

        n += W
        boad.pop()

Submission status: Wrong Answer

Solution code:
import math
H = int(input())
W = int(input())
M = int(input())

if H <= W:
    for i in range(1, H + 1):
        if W * i >= M:
            print(i)

else:
    for k in range(1, W + 1):
        if H * k >= M:
            print(k)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

if h > w:
  print(n//h)
else:
  print(n//w)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())

N = int(input())

boad = [[0] * W for i in range(H)]
n = 0
count = 1
if N <= H or N <= W:
    print(1)

elif H < W:

    boad.pop()
    n = W
    while(True):
        
        if n + len(boad[0]) >= N:
            count += 1
            print(count)
            break

        elif n + len(boad) >= N:
            count += 1
            print(count)
            break

        n += W
        boad.pop()

elif W < H:
    print(H)
    W -= 1
    boad = boad = [[0] * W for i in range(H)]
    n = H

    while(True):
        
        if n + len(boad[0]) >= N:
            count += 1
            print(count)
            break

        elif n + len(boad) >= N:
            count += 1
            print(count)
            break

        n += H
        W -= 1
        count += 1
        boad = [[0] * W for i in range(H)]

else:
    pass

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
count = 1
if(h >= w):
    while(n > h):
        h += h
        count += 1
    print(count)
else:
    while(n > w):
        w += w
        count += 1
    print(count)

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())
a=max(h,w)
b=0
m=0

while b+a<=n:
	b+=a
	m+=1
print(m)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
a = max(h,w)
b = a
count = 0
if h*w == n:
  print(h)
else:
 while b <= n:
   b += a
   count += 1
 print(count)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

if n / max(h, w) > n:
    print(n // max(h, w) + 1)
elif n / max(h, w) == 1:
    print(1)
elif n / max(h, w) < 1:
    print(1)
else:
    print(n // max(h, w))

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
count = 0
if(h >= w):
    while(n > h):
        h += h
        count += 1
    print(count)
else:
    while(n > w):
        w += w
        count += 1
    print(count)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())

count = 0
n_black = 0
list_mesh = [H, W]

while n_black < N:
    id_max = list_mesh.index(max(list_mesh))
    n_black += list_mesh[id_max]
    list_mesh[id_max] -= 1
    count += 1

print(count)

Submission status: Wrong Answer

Solution code:
H = int(input())
W = int(input())
N = int(input())
if W >= H:
    print(N // W)
else:
    print(N // H)

Submission status: Wrong Answer

Solution code:
h=int(input())
w=int(input())
n=int(input())
ans=0
x=max(h,w)
while n>0:
    ans+=1
    n=n-ans*x
print(ans)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())
count = 0
if(h >= w):
    while(n > h):
        n -= h
        count += 1
    print(count)
else:
    while(n > w):
        n -= w
        count += 1
    print(count)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

cell_cnt=0
x=0

for x in range(h):
	cell_cnt+=w
	if cell_cnt>=n:
		break

cell_cnt = 0
for y in range(w):
	cell_cnt+=h
	if cell_cnt>=n:
		break

print(max(x+1,y+1))

Submission status: Wrong Answer

Solution code:
H,W,N = [int(input()) for _ in range(3)]
print(N/max(H,W)+1)

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

lo = max(h,w)
lp = min(h,w)

cnt_h = 0
cnt_w = 0

cnt = 0
tmp = 0
for _ in range(h*w):
    if tmp < n and tmp+lo <= n and cnt_h <= w:
        tmp += lo
        cnt += 1
        cnt_h += 1
    elif tmp < n and tmp+lo >= n and cnt_w <= h:
        tmp += lp
        cnt += 1
        cnt_w += 1
    else:
        break
print(cnt)

Submission status: Wrong Answer

Solution code:
h = int(input())
w=  int(input())
n = int(input())


sum = 0
if h > w:
    for i in range(h):
        sum = sum + h
        if n <= sum:
            print(int(sum/h))
            break
elif w > h:
    for i in range(w):
        sum = sum + w
        if n <= sum:
            print(int(sum/w))
            break

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

a = max(h, w)
ans = 1

while a < n:
  a = max(h, w)
  a *= ans
  ans += 1
  
print(ans-1)

Submission status: Wrong Answer

Solution code:
h = int(input())
w=  int(input())
n = int(input())


sum = 0
if h > w:
    for i in range(h):
        sum = sum + h
        if n <= sum:
            print(int(sum/h))
            break
    if n > sum:
        for i in range(w):
            sum = sum + w -1 
            if n <= sum:
                print(int(sum/w))
                break
        
elif w > h:
    for i in range(w):
        sum = sum + w
        if n <= sum:
            print(int(sum/w))
            break
    if n > sum:
        for i in range(h):
            sum = sum + h -1 
            if n <= sum:
                print(int(sum/h))
                break

Submission status: Wrong Answer

Solution code:
h = int(input())
w = int(input())
n = int(input())

if n / max(h, w) > n:
    print(n // max(h, w) + 1)
else:
    print(n // max(h, w))

Submission status: Wrong Answer

Solution code:
h = int(input())
w=  int(input())
n = int(input())


sum = 0
if h > w:
    for i in range(h):
        sum = sum + h
        if n <= sum:
            print(int(sum/h))
    if n > sum:
        for i in range(w):
            sum = sum + w -1 
            if n <= sum:
                print(int(sum/w))
                break
        
elif w > h:
    for i in range(w):
        sum = sum + w
        if n <= sum:
            print(int(sum/w))
            break
    if n > sum:
        for i in range(h):
            sum = sum + h -1 
            if n <= sum:
                print(int(sum/h))
                break