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.
int chocolateFeast(int n, int c, int m) {
int i,sum,x,j;
sum=n/c;
x=sum;
if(sum==0)
return 0;
while(x>=m)
{
j=x%m;
i=x/m;
sum=sum+i;
x=i+j;
}
return sum;
}
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 →
int chocolateFeast(int n, int c, int m) { int i,sum,x,j; sum=n/c; x=sum; if(sum==0) return 0; while(x>=m) { j=x%m; i=x/m; sum=sum+i; x=i+j; } return sum; }