zoukankan      html  css  js  c++  java
  • C

    Problem description

    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根蜡烛,每烧完一根蜡烛需要一个小时,而且每烧完b(b<=a)根蜡烛就能产生一根新的蜡烛,求这些蜡烛全部烧完需要多少个小时,水过!

    AC代码:

    1 #include<bits/stdc++.h>
    2 using namespace std;
    3 int main(){
    4     int a,b;cin>>a>>b;
    5     for(int i=1;i<=a;++i)
    6         if(i%b==0)a++;
    7     cout<<a<<endl;
    8     return 0;
    9 }
  • 相关阅读:
    python练习册 0002随机生成验证
    女生应该找什么样的男生
    博弈论 尼姆博弈,人生第一道博弈纪念一下
    博弈论版版
    博弈论
    STL用法大全
    据说是Flord算法
    20190716-T3-奇袭
    20190716-T1-礼物
    20190716-被水题淹没
  • 原文地址:https://www.cnblogs.com/acgoto/p/9179142.html
Copyright © 2011-2022 走看看