409806: GYM103785 A BCD

With the end of the semester, the admins of BITS Pilani are organising their very own Book Collection Drive (BCD). After some calculations and using previous data, they have estimated that $$$N$$$ books would be donated by the students in total.

To collect the books, they would need to keep some boxes in each bhawan. Each box can hold $$$K$$$ books at max. Now the admins want to know – what is the minimum number of boxes that would be required to collect all the books?

The first and only line of input consists of two space-separated integers, $$$N$$$ $$$(1 \leq N \leq 1000)$$$ and $$$K$$$ $$$(1 \leq K \leq 100)$$$.

Print the minimum number of boxes.

10 5

2

12 5

3

In the first case, a valid distribution of books is $$$5+5$$$, hence the minimum number of boxes would be $$$2$$$.

In the second case, a valid distribution of books is $$$5+5+2$$$, hence the minimum number of boxes would be $$$3$$$.

In both cases, it can be shown that it would be impossible to collect all books with lesser boxes.