Hello!

I have such task:
I need to divide one-dimenshion arrange (with Natural numbers and zeroes) on N subarranges where the sum of elements in each of them is equal.( Optionally I want the quantity of elements in each subarrange was equal too, but it's the second question).

Brute force algorithm is bad, and how to apply the task of rucksack  I don't see at all as there are no values on elements of arrange.

I suppose, it exists another optimal algorithm which solves this task. Please, help me, show the task where I can find the algorithm-solution. I was told that in this site exists such task...

TIA!