The objective is to find the biggest value (that what this program does) and if
we find out that: k - (BoxN*144) or (BundleN*12) or PairN != 0; Then program has to go back to the process of number arranging without the value that was the biggest; At the end result should be: Box number:2; Bundle number: 5, Pair number: 7;
Simple as that! But sadly I'm not experienced enough to solve this.
For more details this program is about buying boxes (*aoi = BoxN*144),
bundles (*aoi = BundleN*12),
or pairs of socks (*aoi = 1)
And the goal is to buy them most efficient way; If you can't use the most efficients way**, then use second as much efficient way, it is determined from values - var1, var2, var3;
*aoi - amount of items in it is calculated by:
**can't use because of the too big amount of number is being buyed e.x. need to buy 12 items so it can't be done with a box, because we buy 144-12=132 too many of it.