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

Chocolate Feast

  • ssaurabh44
     + 0 comments

    Chk this :Worked for all test cases: for(int a1=0;a1 

            no = n/c;

        int wrapper = no;
        int rem = 0;
        while(wrapper>=m){
            rem = wrapper/m;
            no = no +rem;
            rem = rem + wrapper%m;
            wrapper = rem;


        }

        System.out.println(no);
    }