Hi all, I have a 2d array X, say of size AxB. Each cell has a capacity limit, lets mark the capacity limit of cell [i,j] by L[i,j].
My problem is that I want to find all possible arrays that for every cell 0 <= X[i,j] <= L[i,j]. Can anybody give me a rough draft for such an algorithm? thanks.
