// Chocolate Feast /* Chocolate shop is having a promotion.If you saves enough wrappers, you can turn them in for a free chocolate. We need to find out howmany maximum chocotaes can be eaten if below input is given : n = total Rs c = cost of each chocolate m = wrapers required to get a new chocolate */ /* sample input and output 1: n = 15 c = 3 m = 2 from 15 rs. get 5 chocolate as 15/3 = 5. Now 5 chocolates will give you 5 wrapers.. use 4 wrapers and get two chocolates (5+2 = 7 chocolate in total) and have balanced wrapers as 1. new two chocolate will give two wrappers to become it 3... use 2 wrapers to get new chocolate (total 8 now). wraper balanced was 1 and new chocolate will give one wraper to make it as two wrapers to buy a chocolate (total 9 now ) and ends with 1 wraper only so cannot have chocate now. so, output is 9 chocolates Sample input 2 n = 10 c = 2 m = 5 Sample Output 2 Chocolates = 6 Sample input 3 n = 12 c = 4 m = 4 Sample Output 3 Chocolates = 3 Sample input 4 n = 6 c = 2 m = 2 Sample Output 4 Chocolates = 5 */ #include using namespace std; int main() { int n = 15; // total rs int c = 3; // cost of a chocolate int m = 2; // total empty wraper to get a chocolate // total chocolates from rs available int intchocolates = n / c; // total wrapers from chocolates int intWrapers = intchocolates; // if wrapers are equal to or more than number to get a chocolate back while(intWrapers>=m) { // new chocolates from wrapers int intTempChocolates = intWrapers / m ; // total chocolates as initial chocolates with additional (wraper) chocolates intchocolates += intTempChocolates ; // balanced wrapers without consuming new chocolates intWrapers = intWrapers % m; // balanced wrapers after consuming new chocolates intWrapers += intTempChocolates ; } // print input values cout << "Total available Rs. : " << n << endl; cout << "Cost of each chocolate : " << c << endl; cout << "Wrapers 2 return 4 new chocolate : " << m << endl << endl << endl; // print output cout << "Max possible chocolates : " << intchocolates ; return 0; }

ChocolateFeast