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

  • great_coder + 4 comments

    Following code works for me:

    wrappers = n/c;

    count = wrappers;

    while (wrappers >= m) {

    wrappers = wrappers - m;

    count = count + 1;

    wrappers = wrappers + 1;

    }

    System.out.println (count);

    • Debu_Basu + 1 comment

      I couldn't figure out the algo. Pls help.

      • jbonedev + 1 comment

        First, your total (initial) number of chocolates, and wrappers, is equal to what you can buy with cash, which is n/c. Now you have to iteratively give your wrappers to the shop keeper, in exchange for chocolates, costing you m wrappers (wrappers / m). During this iterative process you add the chocolates to your total count. You subtract the number of wrappers you have handed in and also add back the number of wrappers you receive from the chocolates you are getting back. Here's a java 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 total = n/c;
        int wrappers = total;
        while(wrappers >= m) { 
            total += (wrappers / m);
            int leftover = wrappers % m;
            wrappers = (wrappers / m) + leftover;
        }
        System.out.println(total);
    }
}
        • TechJack4 + 0 comments

          That's exactly what I did.

    • cferguson + 1 comment

      That's basically what I did, except in Python.

      choc, wrappers = [int(n/c), int(n/c)]
while (wrappers >= m):
    choc+= 1
    wrappers -= m
    wrappers += 1
print(choc)
      • SebastianNielsen + 1 comment

        A better version:

        choc = wrappers = n // c

while (wrappers >= m):
    choc+= 1
    wrappers -= m - 1 
print(choc)
        • mike_buttery + 0 comments

          Similar here without iterating every bar/wrapper swap

          bars = wrappers = n // c
 
while wrappers >= m:
    bars += wrappers // m
    wrappers -= wrappers // m * (m - 1)

return bars
    • Purist238 + 0 comments

      Same as mine!

    • renyo + 2 comments

      i dont get it, why sum plus one on wrappers at the end of the loop... ? that was my mistake...

      • Deepeka + 0 comments

        every time you subtract m wrappers you get one chocolate so one more wrapper so you add 1

      • shankarpenore + 0 comments

        You are just right brother