{"problem":{"name":"Painting","description":{"content":"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 follow","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"keyence2020_a"},"statements":[{"statement_type":"Markdown","content":"We have a grid with $H$ rows and $W$ columns, where all the squares are initially white.\nYou will perform some number of painting operations on the grid. In one operation, you can do one of the following two actions:\n\n*   Choose one row, then paint all the squares in that row black.\n*   Choose one column, then paint all the squares in that column black.\n\nAt 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.\n\n## Constraints\n\n*   $1 \\leq H \\leq 100$\n*   $1 \\leq W \\leq 100$\n*   $1 \\leq N \\leq H \\times W$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$H$\n$W$\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"keyence2020_a","tags":[],"sample_group":[["3\n7\n10","2\n\nYou can have $14$ black squares in the grid by performing the \"row\" operation twice, on different rows."],["14\n12\n112","8"],["2\n100\n200","2"]],"created_at":"2026-03-03 11:01:14"}}