【HackerRank】 Chocolate Feast

Little Bob loves chocolates, and goes to the store with $N money in his pocket. The price of each chocolate is $C. The store offers a discount: for every M wrappers he gives the store, he'll get one chocolate for free. How many chocolates does Bob get to eat?

Input Format:
The first line contains the number of test cases T(<=1000).
T lines follow, each of which contains three integers N, C and M

Output Format:
Print the total number of chocolates Bob eats.

Constraints:
2≤N≤105

---

是有可能有多轮兑换的，比如N=10，C=3，M=2的时候，第一轮买到5个巧克力，用其中四个换回两块，此时手上一共有3个包装纸，第二轮换到1个巧克力，此时手上有两个包装纸，又可以换一块巧克力，一共兑换了3轮。

代码如下：

 import java.io.*;
 import java.util.*;
 import java.text.*;
 import java.math.*;
 import java.util.regex.*;

 public class Solution {

     public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
         int t = in.nextInt();
         for(int i = 0; i < t; i++){
             System.out.println(Solve(in.nextInt(), in.nextInt(), in.nextInt()));
         }
     }

     private static long Solve(int n, int a, int b){

          //Write code to solve each of the test over here
         int origin = n/a;
         int total = origin;
         while(origin/b>0){
             int free = origin/b;
             origin = free + origin%b;
             total += free;
         }
         return total;
     }

 }