379A.md (1240B)
1 Source: https://codeforces.com/problemset/problem/379/A 2 3 A. New Year Candles 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles. 22 23 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. 24 25 Now Vasily wonders: for how many hours can his candles light up the room if he acts optimally well? Help him find this number. 26 27 Input 28 29 The single line contains two integers, *a* and *b* (1 ≤ *a* ≤ 1000; 2 ≤ *b* ≤ 1000). 30 31 Output 32 33 Print a single integer — the number of hours Vasily can light up the room for. 34 35 Examples 36 37 Input 38 39 ``` 40 4 2 41 ``` 42 43 Output 44 45 ``` 46 7 47 ``` 48 49 Input 50 51 ``` 52 6 3 53 ``` 54 55 Output 56 57 ``` 58 8 59 ``` 60 61 Note 62 63 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.