CMC: Given x and y, determine the largest integer divisible by x that is less than y. x and y can be any number that isn't 0. You can assume that such a number exists
CMC: Given a list, determine its partition with the minimum length and with all the partition sums equal (you may assume such partition exists, if there are more return the one with the least sublists)