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.
// Complete the chocolateFeast function below.
static int chocolateFeast(int n, int c, int m)
{
int count=0;
count=n/c;
int chocolate=count;
while(chocolate>=m)
{
chocolate=chocolate-m+1;
count++;
}
return count;
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Chocolate Feast
You are viewing a single comment's thread. Return to all comments →
public class Solution {