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

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    H = r_int()
    W = r_int()
    N = r_int()
    u = max(H, W)
    t = N//u
    if N%u != 0:
        t += 1
    print(t)
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
                            
                        
    
    
    
                        
    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
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)

Solution (Python):
import math

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

Solution (Python):
import sys
import math
def input(): return sys.stdin.readline().rstrip()

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

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

if __name__ == '__main__':
    main()

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
h=int(input())
w=int(input())
n=int(input())
maxbox=max(h,w)
print(-(-n//maxbox))

Solution (Python):
import math

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

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

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

x = max(H, W)

count = 0
b = 0
while b < N:
    b += x
    count += 1

print(count)

Solution (Python):
h = int(input())
w = int(input())
if h < w:
  h, w = w, h
n = int(input())
print(-(-n//h))

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

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

Solution (Python):
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    
    H = [int(x) for x in sys.stdin.readline().split()][0]  
    W = [int(x) for x in sys.stdin.readline().split()][0]  
    N = [int(x) for x in sys.stdin.readline().split()][0]  

    
    
    
    

    logger.debug('{}'.format([]))

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


if __name__ == "__main__":
    resolve()





import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """3
7
10"""
        output = """2"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """14
12
112"""
        output = """8"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """2
100
200"""
        output = """2"""
        self.assertIO(input, output)

Solution (Python):
h = int(raw_input())
w = int(raw_input())
n = int(raw_input())
if h > w:
    h, w = w, h
print (n + w - 1) / w

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

Solution (Python):
h = int(input())
w = int(input())
n = int(input())
l = max(h, w)
res = n//l
if n % l != 0:
    res += 1
print(res)

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


if H>=W:
    A = H
else:
    A = W

ans = N//A

if N%A>0:
    ans = ans + 1

print(ans)

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

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

Solution (Python):
H = int(input())



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

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

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

Solution (Python):
import sys

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

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

p=max(H,W)

print(int((N-1/2)//p+1))

Solution (Python):
h = int(input())
w = int(input())
n = int(input())
print(-(-n//h) if h > w else -(-n//w))

Solution (Python):

import sys
input = sys.stdin.readline

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

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

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

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

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

Solution (Python):

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

import math
if H>=W:
    print(int(math.ceil(N/H)))
else:
    print(int(math.ceil(N/W)))

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

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

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

temp = max(h,w)

ans = 0

while n > 0:
    n -= temp
    ans += 1
    
print(ans)

Solution (Python):
from math import ceil

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

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

Solution (Python):


h = int(input())
w = int(input())
n = int(input())
if h<w:
    a = n/w
    if a%1 == 0:
        print(int(a))
    else:
        print(int(a)+1)
else:
    a = n/h
    if a %1 == 0:
        print(int(a))
    else:
        print(int(a)+1)

Solution (Python):
import sys
input = sys.stdin.readline


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

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



if __name__ == '__main__':
    main()

Solution (Python):

h, w, n = [int(input()) for _ in range(3)]
x, i = 0, 0
while x < n:
    x += max(h, w)
    i += 1
print(i)

Solution (Python):
from math import ceil

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

Solution (Python):
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)

Solution (Python):
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




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()

Solution (Python):
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)

Solution (Python):
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()

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

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

import math

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

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

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

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

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

Solution (Python):

import sys


def solve(H: int, W: int, N: int):
    ans=max(H,W)
    print(-(-N//ans))
    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))  
    W = int(next(tokens))  
    N = int(next(tokens))  
    solve(H, W, N)

if __name__ == '__main__':
    main()

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

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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))

Solution (Python):
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)

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

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

Solution (Python):
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))

Solution (Python):

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

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

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

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

Solution (Python):
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)

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

Solution (Python):
import math

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

ima=0

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

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

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

Solution (Python):
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))

Solution (Python):
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)

Solution (Python):
import math

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

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

Solution (Python):
import math

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

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

Solution (Python):
import sys

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








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












if __name__ == "__main__":
	main()

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

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

Solution (Python):
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)

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

Solution (Python):
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()

Solution (Python):
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)

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

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

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

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

Solution (Python):
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)

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

Solution (Python):
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)

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

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

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

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

Solution (Python):
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)

Solution (Python):
from math import ceil

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

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

Solution (Python):
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


print(main())

Solution (Python):
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)

Solution (Python):

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))

Solution (Python):
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

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

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

Solution (Python):
import math

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

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

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

Solution (Python):
h, w, n = [int(input()) for _ in range(3)]
print((n - 1) // max(h, w) + 1)

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

import math

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

Solution (Python):
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()

Solution (Python):
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)

Solution (Python):
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()

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

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

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

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

big = max(h,w)

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

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

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

Solution (Python):
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)

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

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

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

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

Solution (Python):
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)

Solution (Python):
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)

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

Solution (Python):
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)

Solution (Python):
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)

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

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

Solution (Python):
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)

Solution (Python):
import math

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

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

u = max(H, W)

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