Problem p00312 - Generation 2

Orig Description

Frog's Straight Path Home
A frog is trying to get back to its nest. The nest is D centimeters away from the frog, and the frog moves straight towards the nest. The frog can only perform two actions:
 Big jump (move forward L centimeters)
 Small jump (move forward 1 centimeter)
The frog aims to land exactly on the nest without jumping over it.
Write a program to determine the minimum number of jumps the frog needs to make to reach its nest.
Input
The input is given in the following format:
D L
The input is given in one line, where D (1 ≤ D ≤ 10000) is the distance to the nest, and L (2 ≤ L ≤ 10000) is the distance the frog can jump with a big jump.
Output
Output the minimum number of jumps the frog needs to make in one line.
Sample Input 1
10 5
Sample Output 1
2
Sample Input 2
7 4
Sample Output 2
4

Extracted Specification

An integer D (1 ≤ D ≤ 10000), representing some quantity or size.
An integer L (2 ≤ L ≤ 10000), representing some quantity or size.

### Example Input:

```
10 5
```

### Function Signature:
Write a function f(inputs) that takes in the input as a tuple. 
def f(inputs: Tuple[int, int]): 
    ''' 
    inputs: a tuple of two integers 
    '''

Test Case Generator

Sure! Here's a test case generator for the problem "Frog's Straight Path Home":

```python
import random

def tcgen():
    # Generate a random distance D between 1 and 10000
    D = random.randint(1, 10000)
    
    # Generate a random big jump distance L between 2 and 10000
    L = random.randint(2, 10000)
    
    return D, L

# Example usage of the test case generator
for _ in range(5):
    D, L = tcgen()
    print(D, L)
```

### Explanation

1. **Random Distance D**: The distance `D` is generated to be a random integer between 1 and 10000, inclusive. This represents the distance from the frog to its nest.
2. **Random Big Jump Distance L**: The big jump distance `L` is generated to be a random integer between 2 and 10000, inclusive. This represents the distance the frog can cover with a big jump.

### Example Outputs
Here are a few sample outputs from the generator:

```
5749 9812
678 8763
123 45
9999 100
4500 3000
```

These generated test cases can be used to test the program's ability to calculate the minimum number of jumps the frog needs to reach its nest.

Extract Arguments

def extract_arguments(fh):
    D, L = map(int, fh.readline().strip().split())
    return D, L