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 in C# (Mono 4.6.2.0) (judge verdict: Accepted)

/*********************************************
* 20.05.11 AtCoder Beginner Contest 157. A, B, C
* 
*
*********************************************/
/*********************************************
::test input::
*********************************************/

namespace TempName{
    using System;
    using System.Linq;
    using System.Collections.Generic;
    using System.Reflection;
    using static System.Console;
    using static IOmacro.CSharpInput; 
    using static IOmacro.CppInput;
    using static IOmacro.CConst;
    using static STLExtension.CppExtension;

    public class CRun{
        public readonly char problem_num = 'A';
        
        public void solve_1() {
            // A - Painting 
            // H,W필드
            // 처음엔 백색이었다 행 또는 열을 고르면 그 행 또는 열 전부 흑색
            // N개 이상의 필드가 흑색이 되기 위한 최소 실행 횟수는?
            
            int h = _int;
            int w = _int;
            int n = _int;
            
            int ans = MINI;
            
            for (int iy = 0; iy <= h; iy++) {
                int kuro_cnt = iy * w;
                
                if (kuro_cnt >= n) {
                    ans = Math.Min(ans, iy);
                }
                else {
                    int ix_chk = (n - kuro_cnt) / (h - iy);
                    int ix_rem = (n - kuro_cnt) % (h - iy);
                    if (ix_chk <= w) {
                        if (ix_rem == 0) {
                            ans = Math.Min(ans, iy + ix_chk);
                        }
                        else {
                            ans = Math.Min(ans, iy + ix_chk + 1);
                        }
                    }
                }
            }
            
            WriteLine(ans);
        }

        public void solve_2() {
            
        }

        public void solve_3() {
            
        }
        
        public void solve_4() {
            
        }
        
        public void solve_5() {
            
        }
        
        public void solve_6() {
            
        }
    }
    
    class Program { 
        static void Main() { 
            var run = new CRun();
            if (run.problem_num == 'A') run.solve_1(); 
            if (run.problem_num == 'B') run.solve_2(); 
            if (run.problem_num == 'C') run.solve_3();
            if (run.problem_num == 'D') run.solve_4();
            if (run.problem_num == 'E') run.solve_5();
            if (run.problem_num == 'F') run.solve_6();
        } 
    }
}

namespace IOmacro {
    //20.05.10. 수정
    
    using System; 
    using System.Linq; 
    using System.IO;
    using System.Collections.Generic;
    
    public class CSharpInput {
        public static StreamWriter _writer = new StreamWriter(Console.OpenStandardOutput());
        public const char separator = ' ';
        public static string _string{get{return Console.ReadLine();}}
        public static string[] _stringa{get{return (Console.ReadLine().Split(separator));}}
        public static int _int{get{return int.Parse(Console.ReadLine());}}
        public static int[] _inta{get{return Console.ReadLine().Split(separator).Select(int.Parse).ToArray();}}
        public static long _long{get{return long.Parse(Console.ReadLine());}}
        public static long[] _longa{get{return Console.ReadLine().Split(separator).Select(long.Parse).ToArray();}}    
        public static double _double{get{return double.Parse(Console.ReadLine());}}
        public static double[] _doublea{get{return Console.ReadLine().Split(separator).Select(double.Parse).ToArray();}}    
    }
    
    public class CConst {
        public static readonly int MINI = int.MaxValue;
        public static readonly long INF = Int64.MaxValue;
    }
    
    public class CppInput {
        public static CppInput cin => new CppInput();
        public const char separator = ' ';
        private static readonly Queue<string> _input = new Queue<string>();
        private CppInput(){}
        public static implicit operator string(CppInput _) {
            if (_input.Count == 0) Console.ReadLine().Split(separator).foreachExtension(x => _input.Enqueue(x));
            return _input.Dequeue();
        }
        public static implicit operator int(CppInput _){
            if (_input.Count == 0) Console.ReadLine().Split(separator).foreachExtension(x => _input.Enqueue(x));
            return int.Parse(_input.Dequeue());
        }
        public static implicit operator long(CppInput _){
            if (_input.Count == 0) Console.ReadLine().Split(separator).foreachExtension(x => _input.Enqueue(x));
            return long.Parse(_input.Dequeue());
        }
        public static implicit operator double(CppInput _){
            if (_input.Count == 0) Console.ReadLine().Split(separator).foreachExtension(x => _input.Enqueue(x));
            return double.Parse(_input.Dequeue());
        }
    }
    
    public static class EnumerableExtension {
        public delegate void Function<in T>(T val);
        public static void foreachExtension<T>(this IEnumerable<T> enumerable, Function<T> function) {
            foreach (var x in enumerable) function(x);
        }
    }
}

namespace STLExtension {
    //20.05.05. 수정
    
    public class CppExtension {
        public static int PopCount(int n) {
            //A SWAR Algorithm for Popcount
            //비트의 1의 개수            
            int msb = 0;
            if (n < 0) { n &= int.MaxValue; msb = 1; }
            n = n - ((n >> 1) & 0x55555555);
            n = (n & 0x33333333) + ((n >> 2) & 0x33333333);
            return (int)(((n + (n >> 4) & 0xF0F0F0F) * 0x1010101) >> 24) + msb;
        }
    }
}