ToastXRaspberry | Topcoder Archive

Problem Statement

You have some raspberry jam and a slice of plain toast. You're going to create a slice of breathtaking raspberry toast by applying some of the jam to the toast. Each application will apply L layers of raspberry jam, where L is a positive integer (chosen before the application) and L is not greater than upper_limit. A slice of breathtaking raspberry toast is a slice of plain toast that has had exactly layer_count layers of raspberry jam applied. Return the minimum number of applications required to turn a slice of plain toast into a slice of breathtaking raspberry toast.

Definition

Class:: ToastXRaspberry
Method:: apply
Parameters:: int, int
Returns:: int
Method signature:: int apply(int upper_limit, int layer_count)
(be sure your method is public)

Constraints

upper_limit will be between 1 and 100, inclusive.
layer_count will be between 1 and 1000, inclusive.

Examples

```
4
```
```
13
```
```
Returns: 4
```
One possible way is to apply 4, 4, 3, then 2 layers of jam.
```
8
```
```
5
```
```
Returns: 1
```
A single application is sufficient.
```
73
```
```
265
```
```
Returns: 4
```

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.