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.
  1. Practice
  2. Algorithms
  3. Implementation
  4. Chocolate Feast
  5. Discussions

Chocolate Feast

  • shashwatkhanna31 + 3 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 + 4 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 + 2 comments

        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

        • chay_29 + 0 comments

          thanks.anyways, i got it.

      • pcortezzi + 0 comments

        Your code is flawless. Quick, simple and completely readable! Congratulations!

      • frankdeadlycaste + 1 comment

        see this

        def chocolateFeast(n, c, m):

        ch = n/c
all_ch = ch
while (ch>=1):
        all_ch += ch/m
        ch = ch/m + ch%m
return all_ch
        • prathameshbagek1 + 0 comments

          Did almost the same thing in Java8

          static int chocolateFeast(int n, int c, int m) {
        int sum = n / c;
        if (sum < m) return sum;
        if (sum == m)   return sum + 1;
        int choc = sum, wrap = choc;
        do {
            choc += wrap / m;
            wrap = (wrap / m) + (wrap % m);
        } while (wrap >= m);
        return choc;
    }
    • 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

    • agwolgemuth + 1 comment

      I did something similar. As several others have noted, it's an inefficient approach, but it was really quick to write and handled all the test cases so I considered it fit for purpose.

      • firozbhaikardar1 + 0 comments

        int chocolateFeast(int n, int c, int m) { int i,sum,x,j; sum=n/c; x=sum; if(sum==0) return 0; while(x>=m) { j=x%m; i=x/m; sum=sum+i; x=i+j; } return sum; }