Painting

AtCoder
IDkeyence2020_a
Time2000ms
Memory256MB
Difficulty
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$ [samples]
Samples
Input #1
3
7
10
Output #1
2

You can have $14$ black squares in the grid by performing the "row" operation twice, on different rows.
Input #2
14
12
112
Output #2
8
Input #3
2
100
200
Output #3
2
API Response (JSON)
{
  "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 follow...",
      "is_translate": false,
      "language": "English"
    }
  ]
}
Full JSON Raw Segments