Deviding N(1,2,3,..,N) part from numeric list as summation of each values(don't sorted) has highest as possible.
Nuen9
amornsak.nak at gmail.com
Mon Oct 10 12:25:28 EDT 2016
> Hi!
>
> Could it be, "Nuen9", that you would like to find a split where the
> split sums are close to each other? In other words, you define the
> number of splits (in your example: 3) and the algortihm should test all
> possible combinations and select the split where the sum differences are
> smallest.
>
> Best,
> Kimmo
Yes it is, I want example python code for finding my answers but I don't code my answers. please help me.
More information about the Python-list
mailing list