@@ -0,0 +1,831 @@
+/**%0A * %0A */%0Apackage algorithms.implementation;%0A%0Aimport java.util.Scanner;%0A%0A/**%0A * Challenge: https://www.hackerrank.com/challenges/chocolate-feast%0A * %0A * @author Sudharsanan Muralidharan%0A */%0Apublic class ChocolateFeast %7B%0A  public static void main(String%5B%5D args) %7B%0A    Scanner in = new Scanner(System.in);%0A    int t = in.nextInt();%0A   %0A    while (t-- %3E 0) %7B%0A      int n = in.nextInt();%0A      int c = in.nextInt();%0A      int m = in.nextInt();%0A%0A      int chocolates = 0;%0A      int numBought = (n / c);%0A      chocolates += numBought;%0A      %0A      int wrappers = numBought;%0A      while (wrappers %3E= m) %7B%0A        numBought = (wrappers / m);%0A        chocolates += numBought;%0A        int wrappersLeft = (wrappers %25 m);%0A        wrappers = numBought + wrappersLeft;%0A      %7D%0A%0A      System.out.println(chocolates);%0A    %7D%0A    in.close();%0A  %7D%0A%7D%0A

Add solution for ChocolateFeast