this is the sandwich cutting problem. successful
this is the evening of chocolates problem, successful except for corner cases
this does k-balancing for large numbers. solution needs O(n) modification.