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

  • dheeraj + 13 comments
    43203 / 60 = 720 chocolates ( 3 dollars left and you cannot buy any more chocolate for 3 dollar ) 

720 / 5 = 144 chocolates ( we can buy 144 chocolates from 720 wrappers ) 

144 / 5 = 28 chocolates ( we can buy 28 chocolates from 144 wrappers, 4 wrappers left ) 

(28 + 4 ) / 5 = 6 ( 28 wrappers + 4 wrappers left from 144, we can buy 6 chocolates ) 

(6 + 2) / 5 = 1 ( 6 wrappers + 2 wrappers left from 32 wrappers, we can buy 1 chocolate ) 


This sums to 720 + 144 + 28 + 6 + 1 = 899.
    • SudeepSrivastav + 0 comments
      [deleted]
    • pulkitcoder + 0 comments

      Same problem with my code also.

    • alejandro33 + 0 comments

      thaks I miss that case

    • Storm__Shadow + 0 comments
      [deleted]
    • Storm__Shadow + 0 comments
      [deleted]
    • Storm__Shadow + 0 comments
      [deleted]
    • Storm__Shadow + 0 comments
      [deleted]
    • koushik_077 + 0 comments

      check out this code .. https://www.hackerrank.com/challenges/chocolate-feast/submissions/code/20066920

    • abhishekramkumar + 2 comments

      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 + 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; }

      • kris_tobiasson + 0 comments

        Heres some JS:

            let wrappers = Math.floor(n / c);
    let count = wrappers;

    while(wrappers >= m){
        let add = Math.floor(wrappers/m);
        wrappers -= (add * m);
        wrappers += add;
        count += add;
    }
    return count;
    • alokmhn5 + 0 comments

      there is problem with ur code. 899 is correct.

    • dropyghost + 0 comments

      any idea if 3 dollars left are carry to next trip?

    • iainws + 0 comments

      thanks. I had a terrible time with this problem. maybe it was the noise in my environment, maybe it was something to do with the computer i'm using... I couldn't get it exactly right untill I read this. Thanks for the code.

    • hrshtvrm + 1 comment

      Why does this time out?

      import java.util.*;
public class q{
     public static void main(String args[]){
         Scanner sc=new Scanner(System.in);
         int t=sc.nextInt();         
         for(int g=0;g<t;g++){
             int n=sc.nextInt(),c=sc.nextInt(),m=sc.nextInt();
             int totalChoc=0;int wrappers=n/c;
             while(wrappers>0){                                
                 totalChoc=n/c+wrappers/m;
                 wrappers=wrappers%m;}
             System.out.println(totalChoc);}}}
      • abishek_surpur2 + 3 comments
        def chocolateFeast(n, c, m):
 ch=n//c
 wr=ch
 while(wr>=m):
    ch+=wr//m
    wr=wr//m+wr%m
 return ch

        try this out with time comlexity less than O(n) :)

        • shivam_hackgod + 1 comment

          can you explain why my code is not giving output for testcase 8 only.

          def chocolateFeast(n, c, m): inichoc=n//c total=inichoc leftwrap=0 i=0 while inichoc+leftwrap>=m: addchoc=math.floor((inichoc+leftwrap)/m) leftwrap=(inichoc-i)%m total+=addchoc inichoc=addchoc i+=1 return total

        • petia_davidova + 0 comments

          What is the complexity of this? I have the same solution but I am not sure what my complexity is, I find it a bit difficult. :)

        • frankdeadlycaste + 1 comment

          try 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
          • chay_29 + 1 comment

            GOT IT MAN

            • chay_29 + 0 comments

              THANKS