CF379A.New Year Candles

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.

Vasily has $a$ candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make $b$ went out candles into a new candle. As a result, this new candle can be used like any other new candle.

Now Vasily wonders: for how many hours can his candles light up the room if he acts optimally well? Help him find this number.

输入格式

The single line contains two integers, $a$ and $b$ $(1<=a<=1000; 2<=b<=1000)$ .

输出格式

Print a single integer — the number of hours Vasily can light up the room for.

输入输出样例

输入#1
```
4 2
```
输出#1
```
7
```
输入#2
```
6 3
```
输出#2
```
8
```

说明/提示

Consider the first sample. For the first four hours Vasily lights up new candles, then he uses four burned out candles to make two new ones and lights them up. When these candles go out (stop burning), Vasily can make another candle. Overall, Vasily can light up the room for 7 hours.

首页