“+”、“-”号构成的阵列

The Matrixes Consisted of“+”and“-”

寻找“＋”、“－”号个数相等的阵列问题是尚未完全解决的问题。给出它的计算机算法，并具体地算出了第一行有Ｎ１（３≤Ｎ１≤３６）个“＋”、“－”号的解的例子，算出了第一行有Ｎ２（３≤Ｎ２≤２４）个“＋”、“－”

Finding the matrixes which consist of same individuals of “+” and “-” is also a problem that has not been solved completly.An algorithms for it by computer was pointed out, and both an sample with N1(3≤N1≤36)individuals of “+” and “-” in row 1 and the N2(3≤N2≤24)individuals of “+” and “-” in row 1 were computed.