c++ Implement a feature that recursively calculates how many drinks you can buy. You get three input parameters: money: how much money you have to buy drinks for. price: how much a drink costs. deposit rate: how many empty cans you can deposit to get a new drink. Example: money = 16, price = 2, deposit rate = 2 You buy 8 drinks for your money (16/2 = 8). You return 8 cans and get 4 drinks. You return 4 cans and get 2 drinks. You return 2 cans and get 1 drink. result: 15 drinks
c++
Implement a feature that recursively calculates how many drinks you can buy.
You get three input parameters:
money: how much money you have to buy drinks for.
price: how much a drink costs.
deposit rate: how many empty cans you can deposit to get a new drink.
Example:
money = 16, price = 2, deposit rate = 2
You buy 8 drinks for your money (16/2 = 8).
You return 8 cans and get 4 drinks.
You return 4 cans and get 2 drinks.
You return 2 cans and get 1 drink.
result: 15 drinks
Example 2:
money = 15, price = 1, deposit rate = 3
You buy 15 drinks for your money.
You return 15 cans and get 5 drinks.
You return 3 cans (2 cans left) and get 1 drink.
You return 3 cans and get 1 drink.
result: 22 drinks
Input Expected output
16 2 2 15
15 1 3 22
Step by step
Solved in 3 steps with 2 images
