A. New Year Candles

A. New Year Candles

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

问题链接：A. New Year Candles.

问题简述：

第一行：两个整数a（拥有的蜡烛）,b（可以用b支烧完的蜡烛做一支新蜡烛）。
一支蜡烛可以燃烧一个小时，问：最多燃烧几个小时？

程序说明：

AC通过的C语言程序如下：

#include<stdio.h>
#include<iostream>
using namespace std;

int main ()
{
//s  可以制造的蜡烛  y  制造完剩下的没制造的蜡烛尸体  
	int a,b,s,y;
	scanf("%d%d",&a,&b);
	s=a;
	while(s/b>0)//如果可以造蜡烛
	{
		a = a+s/b;//加上新蜡烛
		y = s%b;//制造完剩下的没制造的蜡烛尸体
		s = s/b+y;//所有尸体
	}
	printf("%d",a);
	return 0;
}