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

  • rohitpal210 + 0 comments

    Here's one way

    int chocolateFeast(int n, int c, int m) {
    int bars,w;
    bars=n/c;
    if(bars<m)
    {
        return bars;
    }
    else if(bars>m)
    {
        w=bars;
        while(w>=m)
        {
            bars+=w/m;
            w=w%m+w/m;
        }

    }
    else
    bars+=1;
return bars;

}