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

  • Theo_Upton
     + 0 comments

    This problem is a geometric series so can be solved with maths.

    int chocolateFeast(int n, int c, int m) {
    return ((long)(n/c)*m-1)/(m-1);
}