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.
I did something similar. As several others have noted, it's an inefficient approach, but it was really quick to write and handled all the test cases so I considered it fit for purpose.
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;
}
Chocolate Feast
You are viewing a single comment's thread. Return to all comments →
I did something similar. As several others have noted, it's an inefficient approach, but it was really quick to write and handled all the test cases so I considered it fit for purpose.
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; }