leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

water_bottles.c (664B)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
// 1518. Water Bottles
#include "leetcode.h"

/*
 * there are 'numBottles' water bottles that are initially full of water. you
 * can exchange 'numExchange' empty water botls from the market with one full
 * water bottle. the operation of drinking a full water bottle turns into an
 * empty bottle. given the two integers 'numBottles' and 'numExchange', return
 * the maximum number of water bottles you can drink
 */

int numWaterBottles(int numBottles, int numExchange) {
  return numBottles + (numBottles - 1) / (numExchange - 1);
}

int main() {
  printf("%d\n", numWaterBottles(9, 3));  // expect: 13
  printf("%d\n", numWaterBottles(15, 4)); // expect: 19
}