New Year Candles

题目描述：

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.

样例输入： 4 2 样例输出： 7

题目的意思就是给你a个蜡烛，每个蜡烛可以点亮一个小时，而消耗每b个蜡烛，可以换一个新的蜡烛，重新点亮一个小时。这道题没什么好说的，就是单纯的模拟，但是我竟然没有立马做出来，还是太菜了

代码如下：

#include<cstdio>
#include<algorithm>
#include<cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn=1e6+10;
int read(){
    int x=0,f=1;char ch=getchar();
    while (ch<'0' || ch>'9'){if (ch=='-')f=-1;ch=getchar();}
    while ('0'<=ch && ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    return x*f;
}
int a,b,ans=0,cnt=0;
int main(){
 cin >> a >> b;
 while(a--){
  ans++;
  cnt++;
  if(cnt%b==0){
   cnt=0;
   a++;
  }
 }
 printf("%d",ans);
    return 0;
}