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

  • 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