Given some cups qith capacity c1, c2, ... and a sink. What is the smallest number of tips to obtain a certain volume? Assumption: All cups start empty and the sink starts with infinite volume.
These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.
Tests require the catch2 library. https://github.com/catchorg/Catch2
- Clion trial version
- Nolasco Napoleão