We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Algorithms
  3. Implementation
  4. Chocolate Feast
  5. Discussions

Chocolate Feast

  • abhishekramkumar + 1 comment

    this kinda worked 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 a0 = 0; a0 < t; a0++){
        int n = in.nextInt();
        int c = in.nextInt();
        int m = in.nextInt();

            int totalChoc = n / c;
        int totalWrappers = totalChoc;
        int freeChocs = 0;
        while (m <= totalWrappers) {
            int wrapperTogive=totalWrappers-(totalWrappers%m) ;

            freeChocs = totalWrappers / m;

            totalWrappers = (totalWrappers - wrapperTogive) + freeChocs;

            totalChoc=totalChoc + freeChocs;

        }

        System.out.println(totalChoc);

    }
}

    }

    • shashwatkhanna31 + 2 comments

      I guess you are doing way to much unnecessary work. Heree is my while loop

      while(m<=wrappers){
        wrappers = wrappers - m;
        totalchocs++;
        wrappers++;
}
      • jason_e_reynolds + 2 comments

        This approach is clean and easy to follow, which is great.

        However, it results in O(N) time (input of 10000 1 2 results in the loop running 9999 times.)

        If you switch the loop to the following you end up with O( lg(N)) (or 14 in the worst case, since you are using integer math).

        def chocolateFeast(cash, cost, wrapper_cost):    

    chocolate = cash//cost
    wrappers = chocolate

    while wrappers // wrapper_cost > 0:
        new_chocolate = wrappers // wrapper_cost
        wrappers -= new_chocolate * wrapper_cost
        wrappers += new_chocolate
        chocolate += new_chocolate
        
    return chocolate
        • akonibrahim1 + 0 comments

          Hi Jason I kind of did the same thing what you did but mine didn't pass the test cases how whats the difference

          import time

          start_time = time.time()

          def chocolateFeast1(he_has,cost,wrapper):

          current_chocates = int(he_has / cost)
current_wrappers = current_chocates

while current_wrappers >= wrapper:
    current_chocates += 1
    current_wrappers -= cost
    current_wrappers += 1

print(f"Took  { time.time() - start_time}")
print (current_chocates)

          start_time = time.time() def chocolateFeast(cash, cost, wrapper_cost): 

          chocolate = cash//cost
wrappers = chocolate

while wrappers // wrapper_cost > 0:
    new_chocolate = wrappers // wrapper_cost
    wrappers -= new_chocolate * wrapper_cost
    wrappers += new_chocolate
    chocolate += new_chocolate

print(f"Took  { time.time() - start_time}")
print (chocolate)
        • rampappula + 1 comment

          wrappers = wrappers % wrapper_cost instead of wrappers -= new_chocolate * wrapper_cost

          was better understandable for me.

          • gwarks + 0 comments

            wrappers %= wrapper_cost would be even shorter

      • manikondapraveen + 0 comments

        your code will result in performance issues when the count is too high. Thats the reason suggested to do with / and % operators