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())
a = max([H,W])
print((N-1)//a+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 math

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

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

Submission status: Accepted

Solution code:
h = int(input())
w = int(input())
n = int(input())
a = max(h, w)
x = 0
ans = 0
while x < n:
    x += a
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    h = int(input())
    w = int(input())
    n = int(input())
    ans = 0
    if n % max(h,w) == 0:
        ans = n // max(h,w)
    else:
        ans = n // max(h,w) + 1
    print(ans)
    return

if __name__=='__main__':
    main()

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(1, 100000):
    if h * i >= n or w * i >= n:
        print(i)
        exit()

Submission status: Accepted

Solution code:
# a, b = map(list(int, input().split()))
import math
h = int(input())
w = int(input())
n = int(input())

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

Submission status: Accepted

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

a = max([h, w])

ans = n // a
if n % a > 0:
    ans += 1

print(ans)

Submission status: Accepted

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

high = max(h,w)
low = min(h,w)

count = 0
ans = 0
for i in range(low):
  count += high
  ans += 1
  if count >= n:
    break
print(ans)

Submission status: Accepted

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

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

print(ans)

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:
H = int(input())
W = int(input())
N = int(input())

bigger = max(H, W)
painted = 0
ans = 0

while painted < N:
    ans += 1
    painted += bigger

print(ans)

Submission status: Accepted

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

hw = max(h,w)

tmp = 0
cnt = 0

if hw == h:
    for i in range(w):
        tmp += h
        cnt += 1
        if tmp >= n:
            print(cnt)
            exit()
else:
    for i in range(h):
        tmp += w
        cnt += 1
        if tmp >= n:
            print(cnt)
            exit()

Submission status: Accepted

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

long_ = max(h,w)

ans = - (-n // long_)

print(ans)

Submission status: Accepted

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

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

hw=max(h,w)

print(int(-1*((-1*n)//hw)))

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())
ans = 10**18
for a in range(H+1):
    for b in range(W+1):
        if a*W+b*H-a*b>=N:
            ans = min(a+b, ans)
print(ans)

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
H=int(input())
W=int(input())
N=int(input())
ans=0
k=0
for i in range(100):
   k+=max(H,W)
   ans+=1
   if k>=N:
       break
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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


print(ans)

Submission status: Accepted

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

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

#a, b, c = (int(i) for i in input().split())  
#a = [int(i) for i in input().split()] 
#e = [[int(i) for i in input().split()] for i in range(n)] 

m = max(H, W)

print(math.ceil(N/m))

Submission status: Accepted

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

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    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 = []  # prime factor
        b, e = 2, 0  # base, exponent
        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
        """
        # TODO: How should I do when n - r is negative?
        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 # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    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 # Deprecated since version 3.5: Use math.gcd() instead.
    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)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        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):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        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]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    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
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    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
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

    H = r_int()
    W = r_int()
    N = r_int()
    u = max(H, W)
    t = N//u
    if N%u != 0:
        t += 1
    print(t)
    
    
    
    # H, W = R()
    # S = [R_str() for _ in range(H)]
    # T = S.copy()
    # for i in range(20):
    #     for j in range(20):
    #         for k in range(20):
    #             for l in range(20):
    #                 if i < k and j < l:
    #                     continue
    #                 elif S[i][j] == '#' or S[k][l] == '#':
    #                     continue
    #                 else:
    #                     T[i][j] = 'start'
    #                     T[k][l] = 'end'
    #                     while True:
                            
                        
    #                     # modosu
    #                     T[i][j] = S[i][j]
    #                     T[k][l] = S[k][l]
                        
    
    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

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

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)
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())
maxbox=max(h,w)
print(-(-n//maxbox))

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

x = max(H, W)

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    # S = [x for x in sys.stdin.readline().split()][0]  # 文字列 一つ
    H = [int(x) for x in sys.stdin.readline().split()][0]  # int 一つ
    W = [int(x) for x in sys.stdin.readline().split()][0]  # int 一つ
    N = [int(x) for x in sys.stdin.readline().split()][0]  # int 一つ

    # N, D = [int(x) for x in sys.stdin.readline().split()]  # 複数int
    # grid = [list(sys.stdin.readline().split()[0]) for _ in range(N)]  # 文字列grid
    # grid = [[int(x) for x in sys.stdin.readline().split()]
    #         for _ in range(N)]  # int grid

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

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


if __name__ == "__main__":
    resolve()

# AtCoder Unit Test で自動生成できる, 最後のunittest.main は消す
# python -m unittest template/template.py で実行できる
# pypy3 -m unittest template/template.py で実行できる

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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

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:
H = int(input())
#N,M = map(int,input().split())
#A = list(map(int,input().split()))
#A = [list(map(int,input().split())) for i in range(N)]
import math
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())

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

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

Submission status: Accepted

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

temp = max(h,w)

ans = 0

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

Submission status: Accepted

Solution code:
from math import ceil

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

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

Submission status: Accepted

Solution code:
#map(int, input().split())
#list(map(int, input().split()))
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# max(h, w)でmin(h, w)の方向に塗りまくる
h, w, n = [int(input()) for _ in range(3)]
x, i = 0, 0
while x < n:
    x += max(h, w)
    i += 1
print(i)

Submission status: Accepted

Solution code:
from math import ceil

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