题目描述

点击查看pdf

In China, there is a very famous problem about pancakes: You have a pan and you can fry two pancakes at the same time each time. For a pancake, its front and back sides need to be cooked, and it takes one hour for each side to be cooked.

So how long does it take at least to cook 3 pancakes? The answer is three hours:

In the first hour, fry the front of No.1 pancake and the front of No.2 pancake.

In the second hour, fry the back of No.2 pancake and the front of No.3 pancake.

In the third hour, fry the back of No.1 pancake and the back of No.3 pancake.

Now you have a pan and you can fry $K$ pancakes at the same time each time. How many hours does it takes at least to cook $N$ pancakes?

It's noticed that you have to fry some side of the pancake until fully cooked every time, it means that you can't fry some side of the pancake half-cooked and taking it out. So the answers are always integers.

输入格式

The first line has two integers $N,K$.

$1\\leq N,K\\leq 100$

输出格式

Output the answer.

样例

3 2 

3 

提示

Form 2020ICPC济南站