学步园

对一副牌中所有的组合进行一个计算，并统计出哪些是无解的，从统计结果来看，无解率达到了20%以上。

对于从1~10的牌数，情况如下，只列举最后一部分以及统计结果：

[7, 8, 9, 10] ,(8/((10-7)/9)),8*(9/(10-7)),(8*9/(10-7)),(9/((10-7)/8)),9*(8/(10-7))

[7, 8, 10, 10] ,(10+7*(10-8))

[7, 9, 9, 9]

[7, 9, 9, 10]

[7, 9, 10, 10]

[7, 10, 10, 10]

[8, 8, 8, 8]

[8, 8, 8, 9]

[8, 8, 8, 10] ,(8+8*(10-8))

[8, 8, 9, 9]

[8, 8, 9, 10]

[8, 8, 10, 10]

[8, 9, 9, 9]

[8, 9, 9, 10]

[8, 9, 10, 10]

[8, 10, 10, 10]

[9, 9, 9, 9]

[9, 9, 9, 10]

[9, 9, 10, 10]

[9, 10, 10, 10]

[10, 10, 10, 10]

TotalCount=715, HaveSolutionCount=566, NoSolutionCount=149

对于包含J、Q、K的牌数，从1~13，情况如下，只列举最后一部分以及统计结果：

[12, 13, 13, 13] ,(12*(13+13)/13),12*((13+13)/13),(12/13)*(13+13),((13+13)/(13/12)),(12+(13-(13/13))),((12+13)-(13/13)),(12/(13/(13+13))),(13+(12-(13/13)))

[13, 13, 13, 13]

TotalCount=1820, HaveSolutionCount=1362, NoSolutionCount=458

附源码：

import get24<br /> def GetAll24():<br /> L=[]<br /> for i in range(1,11,1):<br /> for j in range(i,11,1):<br /> for k in range(j,11,1):<br /> for m in range(k,11,1):<br /> Ltemp=[]<br /> Ltemp.append(i)<br /> Ltemp.append(j)<br /> Ltemp.append(k)<br /> Ltemp.append(m)<br /> L.append(Ltemp)<br /> TotalCount=len(L);NoSolutionCount=0<br /> for i in range(len(L)):<br /> LString = get24.SourceCount(L[i],get24.TOTAL)<br /> if len(LString) > 0:<br /> SumString=''<br /> for j in range(len(LString)):<br /> SumString = SumString+','+LString[j]<br /> print L[i], SumString<br /> else:<br /> NoSolutionCount=NoSolutionCount+1<br /> print L[i]<br /> print "/nTotalCount=%d, HaveSolutionCount=%d, NoSolutionCount=%d" % (TotalCount, TotalCount-NoSolutionCount, NoSolutionCount)<br /> return</p> <p>if __name__ == "__main__":<br /> GetAll24()<br /> print '/n'<br /> raw_input('Press any key to exit...')</p> <p>