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: Accepted

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

big = max(h,w)

count = 0
black = 0
while n > black:
  black += big
  count += 1

print(count)

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from copy import deepcopy

# If you use recursive call, uncomment this code
#sys.setrecursionlimit(10**6)

def main():
    H = int(input())
    W = int(input())
    N = int(input())

    if H < W:
        print(ceil(N/W))
    else:
        print(ceil(N/H))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
h = int(input())
w = int(input())
n = int(input())
d = max(h,w)
ans = 0
box = 0
while box < n:
  ans += 1
  box += d
print(ans)

Submission status: Accepted

Solution code:
def solve(h, w, n):
    s = max(h, w)
    return (n + (s - 1)) // s


def main():
    h = int(input())
    w = int(input())
    n = int(input())
    res = solve(h, w, n)
    print(res)


def test():
    assert solve(3, 7, 10) == 2
    assert solve(14, 12, 112) == 8
    assert solve(2, 100, 200) == 2


if __name__ == "__main__":
    test()
    main()

Submission status: Accepted

Solution code:
import math
H = int(input())
W = int(input())
N = int(input())
target_n = max(H, W)
print(math.ceil(N / target_n))

Submission status: Accepted

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

import math

print(int(math.ceil(N/max(H,W))))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(H: int, W: int, N: int):
    ans=max(H,W)
    print(-(-N//ans))
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  # type: int
    W = int(next(tokens))  # type: int
    N = int(next(tokens))  # type: int
    solve(H, W, N)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
H = int(input())
W = int(input())
N = int(input())
perPaint = max(H,W)
print(math.ceil(N / perPaint))

Submission status: Accepted

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

m = max(h, w)
ans = n // m
if n % m == 0:
    pass
else:
    ans += 1

print(ans)

Submission status: Accepted

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


dekai = max(H, W)

kaisuu = N // dekai + (1 if N % dekai != 0 else 0)

print(kaisuu)

Submission status: Accepted

Solution code:
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys

sys.setrecursionlimit(10**9)
mod = 998244353
inf = 10**20

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

H = I()
W = I()
N = I()

t = max(H,W)
print(math.ceil(N/t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil
H = int(input())
W = int(input())
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
H = int(input())
W = int(input())
N = int(input())

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

Submission status: Accepted

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

import math
print(math.ceil(N/(max(H,W))))

Submission status: Accepted

Solution code:
def div_ceil(x, y): return (x + y - 1) // y

H = int(input())
W = int(input())
N = int(input())
ans = div_ceil(N, max(H, W))
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

ima=0

print(min(math.ceil(n/h), math.ceil(n/w)))

Submission status: Accepted

Solution code:
import math
A = int(input())
B = int(input())
C = int(input())
print(math.ceil(C / max(A,B)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

a = math.ceil(n / h)
b = math.ceil(n / w)
print(min(a, b))

Submission status: Accepted

Solution code:
import sys, math
def input():
    return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter
from math import factorial

sys.setrecursionlimit(10**7)
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: Accepted

Solution code:
import math

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

print(math.ceil(n/max(h,w)))

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines


#mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np


def main():
	h=int(input())
	w=int(input())
	n=int(input())
	a=max(h,w)
	
	print((n-1)//a+1)












if __name__ == "__main__":
	main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline

def calc(h, w):
    return W*h + w*H - w*h

H = int(readline())
W = int(readline())
N = int(readline())
inf = 10**9+7
res = inf

for h in range(H+1):
    for w in range(W+1):
        if calc(h, w) >= N:
            res = min(res, h+w)

print(res)

Submission status: Accepted

Solution code:
import math
H = int(input())
W = int(input())
N = int(input())
ans = math.ceil(N/max(H, W))
print(ans)

Submission status: Accepted

Solution code:
def main():
    H = int(input())
    W = int(input())
    N = int(input())
    from math import ceil
    print(ceil(N/(max(H, W))))


if __name__ == '__main__':
    main()

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ookii=max(h,w)
print((n+ookii-1)//ookii)

Submission status: Accepted

Solution code:
H=int(input())
W=int(input())
N=int(input())
tmp=0
ans=0
while(1):
    ans+=1
    if H<=W:
        tmp+=W
        H-=1
    else:
        tmp+=H
        W-=1
    if tmp>=N:
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(n//max(h,w)) if n%max(h,w)==0 else print(n//max(h,w)+1)

Submission status: Accepted

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

x = max(h,w)
print(n//x+1 if n%x!=0 else n//x)

Submission status: Accepted

Solution code:
H = int(input())
W = int(input())
N = int(input())
a = 10**10
for i in range(W+1):
    for j in range(H+1):
        if i * H + j * (W-i) >= N:
            a = min(i+j,a)
print(a)

Submission status: Accepted

Solution code:
from math import ceil

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

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  h=I()
  w=I()
  n=I()

  a=max(h,w)

  c=0
  for i in range(1,100000):
    c=a*i
    if c>=n:
      return i

# main()
print(main())

Submission status: Accepted

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

ookii = max(h, w)
if n % ookii == 0:
    print(n//ookii)
else:
    print(n//ookii+1)

Submission status: Accepted

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

def ceil(x):
    if x % 1 == 0:
        return x
    else:
        return x//1 + 1

ans = ceil(n/m)
print(int(ans))

Submission status: Accepted

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

x = max(H,W)
for i in range(1,x+1):
    if i*x >= N:
        print(i)
        break

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(n/max(h,w)))

Submission status: Accepted

Solution code:
H=int(input()) 
W=int(input()) 
N=int(input()) 
import math
print(math.ceil(N/max(H,W)))

Submission status: Accepted

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

import math

print(math.ceil(N/max(H,W)))

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil


def main():
    H = int(input())
    W = int(input())
    N = int(input())

    x = max(H, W)
    print(ceil(N / x))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
H, W, N = [int(_) for _ in open(0).read().split()]
print(math.ceil(N / max(H, W)))

Submission status: Accepted

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

if H > W:
    H, W = W, H
print(math.ceil(N / W))

Submission status: Accepted

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

big = max(h,w)

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

Submission status: Accepted

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

ans = -((-N) // max(H, W))
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

if h > w:
    print(((N-1)//h) + 1)
else:
    print(((N-1)//w) + 1)

Submission status: Accepted

Solution code:
H = int(input())
W = int(input())
N = int(input())
import math
x = max(H,W)
print(math.ceil(N/x))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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)
else:
 if n%h==0:
  print(n//h)
 else:
  print(n//h+1)

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

Solution code:
h=int(input())
w=int(input())
n=int(input())
print(min([n//w+(n%w>0),n//h+(n%h>0)]))

Submission status: Accepted

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

T = max(H,W)

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

Submission status: Accepted

Solution code:
import math

H = int(input())
W = int(input())
N = int(input())
print(math.ceil(N/max(H,W)))

Submission status: Accepted

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

u = max(H, W)

print(N // u + (N % u != 0))

Submission status: Accepted

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

m = max(h, w)
answer = math.ceil(n / m)
print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

t = max(h, w)
ans = n // t + bool(n%t)
print(ans)

Submission status: Accepted

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

m=max(h,w)
print(n//m+(n%m!=0))

Submission status: Accepted

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

ans = 0
M = max(H, W)
while ans*M < N:
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
#[int(i) for i in input().split()]
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: Accepted

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

if H > W:
    ans = (N + (H - 1)) // H
else:
    ans = (N + (W - 1)) // W

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

h = I()
w = I()
n = I()

if h > w:
    print(math.ceil(n/h))
else:
    print(math.ceil(n/w))

Submission status: Accepted

Solution code:
from math import ceil

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

m = max(h,w)
print(ceil(n/m))

Submission status: Accepted

Solution code:
import math
H=int(input())
W=int(input())
N=int(input())
if H<W:
    print(math.ceil(N/W))
else:
    print(math.ceil(N/H))

Submission status: Accepted

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

p  =max(H,W)
print( math.ceil(N/p))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
h=int(input())
w=int(input())
n=int(input())
print(-(-n//max(h,w)))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
H = int(input())
W = int(input())
N = int(input())
maxHW = max(H, W)
a = N // maxHW
if N % maxHW != 0:
    a += 1
print(a)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
from math import ceil
H = int(input())
W = int(input())
N = int(input())
print(ceil(N / max(H, W)))

Submission status: Accepted

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 % w == 0:
        print(n // w)
    else:
        print(n // w + 1)

Submission status: Accepted

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


b =  max(H,W)
print(-(-N//b))

Submission status: Accepted

Solution code:
import math
n = int(input())
m = int(input())
x = int(input())
a = max(n,m)
print(math.ceil(x/a))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

ri = lambda: int(input())
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

h = ri()
w = ri()
n = ri()
x = max(h, w)
print((n + x - 1) // x)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# 
# a, b = list(map(int, input().split()))
# s = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(H, W, N):
    return math.ceil(N/ max(H, W))


def main():
    H = read_int()
    W = read_int()
    N = read_int()
    print(slv(H, W, N))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans = 0
count = 0
s = max(h,w)
while ans < n:
    ans += s

    count+= 1

print(count)

Submission status: Accepted

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

h, w = max(h, w), min(h, w)
cnt = 0
for i in range(w):
    cnt += h
    if cnt >= n:
        print(i + 1)
        exit()

Submission status: Accepted

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

m = max(h,w)
if n%m==0:
    print(n//m)
else:
    print(n//m+1)

Submission status: Accepted

Solution code:
import math
h,w,n=[int(input()) for i in range(3)]
print(math.ceil(n/max(h,w)))

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(10000000):
    if max(h,w)*i >= n:
        print(i)
        break

Submission status: Accepted

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

Submission status: Accepted

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

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

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

Submission status: Accepted

Solution code:
from math import ceil

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

mx = max(h, w)

ans = ceil(n / mx)
print(ans)

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
mod=10**9+7
h=int(input())
w=int(input())
n=int(input())
ma=max(h,w)
print((n+ma-1)//ma)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
H = int(input())
W = int(input())
N = int(input())
which = max(H,W)
print(math.ceil(N/which))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

ans = (n+max(h,w)-1) // (max(h, w))
print(ans)

Submission status: Accepted

Solution code:
def main():
    import sys
    import math
    H=int(sys.stdin.readline())
    W=int(sys.stdin.readline())
    N=int(sys.stdin.readline())
    print(math.ceil(N/max(W,H)))

main()

Submission status: Accepted

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

k = max(H,W)
print(-(-N//k))

Submission status: Accepted

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

b = max(H, W)
ans = -(-N // b)
print(ans)

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

H,W,N = map(int,read().split())

x = max(H,W)

answer = (N+x-1)//x
print(answer)

Submission status: Accepted

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

c = int(input())
m = max(a, b)
if(c%m == 0):print(int(c/m))
else:print(int(c/m)+1)

Submission status: Accepted

Solution code:
H = int(input())
W = int(input())
N = int(input())
import math
ans = math.ceil(N/max(H,W))
print(ans)

Submission status: Accepted

Solution code:
H = int(input())
W = int(input())
N = int(input())
ans = 0
p = 0
while p < N:
    p += max(H,W)
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

def updiv(a,b):
    if a % b == 0:
        return a // b
    else:
        return a // b + 1

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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 ;count = 0 ;pro = 1

h=int(input())
w=int(input())
n=int(input())
k=max(h,w)
print(math.ceil(n/k))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
H = int(input())
W = int(input())
N = int(input())
print(-(-N // max(H, W)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from math import ceil
H = int(input())
W = int(input())
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

def ceil(a, b):
   return a // b + (a % b > 0)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H = int(input())
W = int(input())
N = int(input())
big = max(H, W)
from math import ceil
print(ceil(N / big))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(H: int, W: int, N: int):
    if H > W:
        W, H = H, W
    print(-(-N//W))
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  # type: int
    W = int(next(tokens))  # type: int
    N = int(next(tokens))  # type: int
    solve(H, W, N)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

tmp = max(H, W)

print ((N + tmp - 1) // tmp)

Submission status: Accepted

Solution code:
h = int(input())
w = int(input())
n = int(input())
if h < w:
    h,w = w,h

ans = -(-n//h)
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=int(input())
s=int(input())
d=int(input())
print(-(-d//max(a,s)))

Submission status: Accepted

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

print(min(-(-n//h), -(-n//w)))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read

#n = int(input)
#h,w = [int(i) for i in readline().split()]
h,w,n = [int(i) for i in read().split()]

a = max(h,w)

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

Submission status: Accepted

Solution code:
import math
H = int(input())
W = int(input())
N = int(input())
A = max(H, W)
print(math.ceil(N / A))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

A = max(H, W)

ans = -(-N // A)
print(ans)

Submission status: Accepted

Solution code:
from math import ceil
H = int(input())
W = int(input())
N = int(input())
print(ceil(N/max(H,W)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

H = int(input())
W = int(input())
N = int(input())
import math
ans = math.ceil(N/max(H,W))
print(ans)

Submission status: Accepted

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

m = max(h,w)

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

Submission status: Accepted

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

Submission status: Accepted

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

use = max(h, w)

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