跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2213. New Year Candles

  • ID: 2219
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 模拟
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

New Year Candles

题目描述

A. New Year Candles
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Input

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

Output

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

Examples
Input
4 2
Output
7
Input
6 3
Output
8
Note

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.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1819 题。保留原作者与原赛事署名。