CodeForces 379 A.New Year Candles（水~）

Description

a根蜡烛，蜡烛烧一小时后熄灭变成短蜡烛，b个短蜡烛可以换一根新蜡烛，问可以照亮多少小时

Input

两个整数a和b(1≤a≤1000,2≤b≤1000)

Output

输出可以照明的最长时间

Sample Input

4 2

Sample Output

7

Solution

水题，暴力模拟即可

Code

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<cmath>#include<vector>#include<queue>#include<map>#include<set>#include<ctime>using namespace std;typedef long long ll;typedef pair<int,int>P;const int INF=0x3f3f3f3f,maxn=100001;int main(){    int a,b;    while(~scanf("%d%d",&a,&b))    {        int ans=a,num=a;        while(num>=b)        {            ans+=num/b;            num=num/b+num%b;        }        printf("%d\n",ans);    }    return 0;}