New update is available. Click here to update.

Posted: 19 Dec, 2020

Difficulty: Hard

```
1. An axe that is used to cut a lesser or equal number of logs than its limit can be used again.
2. An axe that is used to cut more logs than its limit will be broken. Thus, it cannot be used again.
3. All the axes have the same limit of cutting logs until broken.
4. An axe may also cut N logs or may not even cut a single log.
```

```
Let the number of axes (K) be 2 & the capacity of the log cutting stand (N) be 6.
```

```
From the above example, we can see that the maximum number of moves is 3 for 2 axes and a capacity of 6 logs.
```

```
The first line of input contains an integer ‘T’ denoting the number of queries or test cases.
The first and only line of each input consists of 2 space-separated integers ‘K’ and ‘N’ denoting the number of axes and the capacity of log cutting stand simultaneously.
```

```
For each test case, print the minimum number of moves required to know the limit of the axe.
Print the output of each test case in a separate line.
```

```
You do not need to print anything, it has already been taken care of. Just implement the given function.
```

```
Can you solve this in the worst-case time complexity of N ^ (1/3)
```

```
1 <= T <= 10
1 <= K <= 100
1 <= N <= 10000
```

Categories:

Popular Courses: