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

Sort by

recency

|

1281 Discussions

|

  • wifivop476
     + 0 comments

    def chocolateFeast(n, c, m): count = n//c k=count while(k>=m): count += (k//m) k=((k)//m)+ (k%m) return count to hire personal care contract manufacturer

  • wifivop476
     + 0 comments

    def chocolateFeast(n, c, m): count = n//c k=count while(k>=m): count += (k//m) k=((k)//m)+ (k%m) return count notes ai

  • alban_tyrex
     + 0 comments

    Here is my easy c++ solution , you can watch the explanation here : https://youtu.be/RZti_qPbiAA

    int chocolateFeast(int n, int c, int m) {
    int result = 0, wrappers = 0;
    while( n >= c){
        result ++;
        wrappers ++;
        n -= c;
        if(wrappers == m){
            result ++;
            wrappers = 1;
        }
    }
    return result;
}

  • sayeedahmad06061
     + 0 comments

    def chocolateFeast(n, c, m): count = n//c k=count while(k>=m): count += (k//m) k=((k)//m)+ (k%m) return count

  • somaditya
     + 0 comments

    Java: b for bars, w for wrappers

     public static int chocolateFeast(int n, int c, int m) {
        int b = n/c;
        int w = b;
        
        while (w >= m) {
            b += w/m;
            w = w%m + w/m;
        }
        
        return b;
    }