DMOPC '15 Contest 2 P1 - Grumpy Dwarf
View as PDFIt's a well known fact that  is a grumpy old dwarf who does nothing but smith steel bars into steel swords all day.  has been doing this for so long that he can smith any steel bar into a steel sword without fail. Unfortunately, hard times are upon him: in the 21st century, the market for steel swords has crashed! It is now impossible to sell the swords he makes at a profit anymore. In fact, he can't even break even — it takes  steel swords to trade for a steel bar in today's economy.
However, the dwarven blood runs deep in , so he has sold everything he owns to buy  steel bars. He will smith these into swords and trade them for more steel bars until he has neither steel bars left nor enough steel swords to trade for steel bars, after which he will turn to his true calling of being a programmer.
From the moment when  buys the  steel bars until he becomes a programmer, how many steel swords will he smith in total?
Input Specification
The first line of input will contain one integer  
, the number of steel bars  starts out with.
The second line of input will contain one integer  
, the exchange rate for steel swords to steel bars.
Output Specification
Output one integer, the number of steel swords smiths.
Sample Input
25
5
Sample Output
31
Explanation for Sample Output
 smiths  swords from 
 bars, which he trades for 
 more bars. He then smiths 
 more swords, which he trades for 
 more bar. He smiths his last sword and is finished, having smithed a total of 
 swords.
Comments
I keep getting 70/100. Can someone have a look at my code please?
Try this test case:
The correct answer is 9.
Not Stonks
wheres the profit in this lol