Search:

But the problem is that the algorithm is unknown to me yet.
I thought that it's maybe known to some of you.

No more help? :cry:

Is there still not all clear in my requirement?
Should I explain it more (if possible)?

Maybe I put my requirement in a wrong way.

My requirement is to find submatrixes (minimum amount of them) which sum to my input matrix. Each submatrix must be possible to represent as a one and...

I do mean exactly this.


The same as "Input".


"+" means that my "Input" is a sum of "Output" matrixes.

No, rather not.

So I wrote new example above (https://forums.codeguru.com/showthread.php?565523-Find-cartesians-for-matrix-elements&p=2239678#post2239678)

So maybe another example will be more clear.

Matrix is (dimension 3x3)

101
111
110
Output should be

000 001 100

Hmm... The former matrix's dimension is 3x5, the latter is 5x6.
I thought I wrote it rather clear :ehh:

Hi All! I am new here.
I am wondering what is the name for the following algorithm I need to code. If I know the name I could find the algorithm.

1st example
Suppose I have a matrix

123
Aoo...