int maxMount(int price, int cap, int emptyBottle, int money) { int result = 0; int a, b, m, n; result = money / price; a = b = result; while (a / emptyBottle > 0 || b / cap > 0) { m = a / emptyBottle; n = b / cap; result += m + n; a = a%emptyBottle + m + n; b = b%cap + n + m; } return result; } 换瓶子,AC
点赞 2

相关推荐

牛客网
牛客网在线编程
牛客网题解
牛客企业服务