24点数学游戏

随便输入10以内的4个数字，运算后得到结果为24.

 

实现方法：

新建一个windows应用程序，在窗口中创建4个Testbox控件，用于输入数字；一个button按钮，用于执行计算；一个TextBox控件用于显示组合结果的个数；一个Textbox（多行），用于显示具体的组合方法。

 

 

 

using System;using System.Collections.Generic;using System.ComponentModel;using System.Data;using System.Drawing;using System.Text;using System.Windows.Forms;using System.Collections;namespace _4点{ public partial class Form1 : Form { public Form1() { InitializeComponent(); } private void button1_Click(object sender, EventArgs e) { textBox5.Text = ""; //1 dispose(int.Parse (textBox1 .Text.ToString ()),int.Parse (textBox2 .Text .ToString ()),int .Parse (textBox3 .Text .ToString ()),int.Parse (textBox4 .Text .ToString ()) ); //2 //sb.Remove(0,sb.Length ); textBox5 .Text = sb.ToString (); textBox6 .Text = result .ToString (); } public StringBuilder sb = new StringBuilder (); public int result =0;private int[] aArray = new int[2];private int[] bArray = new int[2];private int[] cArray = new int[2];private int[] dArray = new int[2];/*** main方法* * @param args*/ //public static void main(String[] args) { // new TwentyFour().dispose(3, 3, 8, 8); //}public void dispose(int a, int b, int c, int d){aArray[0] = a;aArray[1] = 1;bArray[0] = b;bArray[1] = 1;cArray[0] = c;cArray[1] = 1;dArray[0] = d;dArray[1] = 1;core(aArray, bArray, cArray, dArray);}/*** 加*/public int[] plus(int[] a, int[] b){if(0 == a[1]){return new int[]{0,0};}if(0 == b[1]){return new int[]{0,0};}int denominator = leaseCommonMultiple(a[1],b[1]);return new int[]{denominator/a[1]*a[0] + denominator/b[1]*b[0] ,denominator};}/*** 减* @param a* @param b* @return*/public int[] reduce(int[] a, int[] b){if(0 == a[1]){return new int[]{0,0};}if(0 == b[1]){return new int[]{0,0};}int denominator = leaseCommonMultiple(a[1],b[1]);return new int[]{denominator/a[1]*a[0] - denominator/b[1]*b[0] ,denominator};}/*** 乘* @param a* @param b* @return*/public int[] multiply(int[] a, int[] b){return new int[]{a[0] * b[0], a[1] * b[1]};}/*** 除* @param a* @param b* @return*/public int[] divide(int[] a, int[] b){return new int[]{a[0] * b[1], a[1] * b[0]};}/*** 求最小公倍数* @param a* @param b* @return*/public int leaseCommonMultiple(int a, int b){return a*b/greatestCommonDivisor(a,b);}/*** 求最大公约数* @param a* @param b* @return*/public int greatestCommonDivisor(int a, int b) {if(0 == a && 0 == b){return 1;}if (0 == a) {return b;}if (0 == b) {return a;}if (a > b) {int c = a;a = b;b = c;}for (int c = a % b; c > 0; c = a % b) {a = b;b = c;}return b;}/*** 动态加载符号数* @param i* @param a* @param b* @return*/public int[] dispose(int i, int[] a, int[] b){if(i == 0){return plus(a, b);}else if(i == 1){return reduce(a, b);}else if(i == 2){return multiply(a, b);}else{return divide(a, b);}}/*** 动态加载计算数* @param i* @param a* @param b* @param c* @param d* @return*/public int[] number(int i, int[] a, int[] b, int[] c, int[] d){if(i == 0){return a;}else if(i == 1){return b;}else if(i == 2){return c;}else if(i == 3){return d;}else{return new int[]{0,1};}}/*** 核心算法部分* @param a* @param b* @param c* @param d*/private void core(int[] a, int[] b, int[] c, int[] d) {Hashtable map = new Hashtable ();int count = 0;for(int i = 0; i < 4; i++){for(int j = 0; j < 4; j++){for(int k = 0; k < 4; k++){for(int m = 0; m < 4; m++){for(int n = 0; n < 4; n++){if(n == m)continue;for(int o = 0; o < 4; o++){if(o == m || o == n)continue;for(int p = 0; p < 4; p++){if(p == m || p == n || p == o)continue;//类型1：A(A(A(a,b),c),d)int[] result1 = dispose(k,dispose(j,dispose(i,number(m,a,b,c,d),number(n,a,b,c,d)),number(o,a,b,c,d)),number(p,a,b,c,d));//类型2：A(A(a,A(b,c)),d)int[] result2 = dispose(k,dispose(i,number(m,a,b,c,d),dispose(j,number(n,a,b,c,d),number(o,a,b,c,d))),number(p,a,b,c,d));//类型3：A(a,A(b,A(c,d)))int[] result3 = dispose(i,number(m,a,b,c,d),dispose(j,number(n,a,b,c,d),dispose(k,number(o,a,b,c,d),number(p,a,b,c,d))));//类型4：A(a,A(A(b,c),d))int[] result4 = dispose(i,number(m,a,b,c,d),dispose(k,dispose(j,number(n,a,b,c,d),number(o,a,b,c,d)),number(p,a,b,c,d)));//类型5：A(A(a,b),A(c,d))int[] result5 = dispose(j,dispose(i,number(m,a,b,c,d),number(n,a,b,c,d)),dispose(k,number(o,a,b,c,d),number(p,a,b,c,d)));if (0 != result1[1]) {if (result1[0] % result1[1] == 0) {if (result1[0] / result1[1] == 24) {if ((!map.ContainsKey (i))|| (!map.ContainsKey (j))|| (!map.ContainsKey (k))) { //map.Remove(j); //map.Remove(k); if (!map.ContainsKey(i)) { map.Add(i,i); } if (!map.ContainsKey(j)) { map.Add(j, j); } if (!map.ContainsKey(k)) { map.Add(k, k); } //map.Add (j,j); //map.Add (k,k);count += 1; sb = sb.Append("((" + printNumber(m) + printSymbol(i) + printNumber(n) + ")" + printSymbol(j) + printNumber(o) + ")" + printSymbol(k) + printNumber(p) + "/r/n");}}}}if (0 != result2[1]) {if (result2[0] % result2[1] == 0) {if (result2[0] / result2[1] == 24) {if ((!map.ContainsKey(i))|| (!map.ContainsKey(j))|| (!map.ContainsKey(k))) { //map.Remove(i); //map.Remove(j); //map.Remove(k); if (!map.ContainsKey(i)) { map.Add(i, i); } if (!map.ContainsKey(j)) { map.Add(j, j); } if (!map.ContainsKey(k)) { map.Add(k, k); } //map.Add(j,j); //map.Add(k,k);count += 1; sb = sb.Append("(" + printNumber(m) + printSymbol(i) + "(" + printNumber(n) + printSymbol(j) + printNumber(o) + "))" + printSymbol(k) + printNumber(p) + "/r/n");}}}}if (0 != result3[1]) {if (result3[0] % result3[1] == 0) {if (result3[0] / result3[1] == 24) {if ((!map.ContainsKey(i)) || (!map.ContainsKey(j))|| (!map.ContainsKey(k))) { //map.Remove(i); //map.Remove(j); //map.Remove(k); if (!map.ContainsKey(i)) { map.Add(i, i); } if (!map.ContainsKey(j)) { map.Add(j, j); } if (!map.ContainsKey(k)) { map.Add(k, k); } //map.Add(j,j); //map.Add(k,k);count += 1; sb = sb.Append(printNumber(m) + printSymbol(i) + "(" + printNumber(n) + printSymbol(j) + "(" + printNumber(o) + printSymbol(k) + printNumber(p) + "))/r/n");}}}}if (0 != result4[1]) {if (result4[0] % result4[1] == 0) {if (result4[0] / result4[1] == 24) {if ((!map.ContainsKey(i))|| (!map.ContainsKey(j))|| (!map.ContainsKey(k))) { // map.Remove(i); // map.Remove(j); // map.Remove(k); if (!map.ContainsKey(i)) { map.Add(i, i); } if (!map.ContainsKey(j)) { map.Add(j, j); } if (!map.ContainsKey(k)) { map.Add(k, k); } //map.Add(j,j); //map.Add(k,k);count += 1; sb = sb.Append(printNumber(m) + printSymbol(i) + "((" + printNumber(n) + printSymbol(j) + printNumber(o) + ")" + printSymbol(k) + printNumber(p) + ")/r/n");}}}}if (0 != result5[1]) {if (result5[0] % result5[1] == 0) {if (result5[0] / result5[1] == 24) {if ((!map.ContainsKey(i))|| (!map.ContainsKey(j))|| (!map.ContainsKey(k))) { //map.Remove(i); //map.Remove(j); //map.Remove(k); if (!map.ContainsKey(i)) { map.Add(i, i); } if (!map.ContainsKey(j)) { map.Add(j, j); } if (!map.ContainsKey(k)) { map.Add(k, k); } //map.Add(j,j); //map.Add(k,k);count += 1; sb = sb.Append("(" + printNumber(m) + printSymbol(i) + printNumber(n) + ")" + printSymbol(j) + "(" + printNumber(o) + printSymbol(k) + printNumber(p) + ")/r/n");}}}}}}}}}}}//总共几种答案，过滤了类似的答案 //System.out.println("count: " + count); result = count;}public int printNumber(int i){if(i == 0){return aArray[0];}if(i == 1){return bArray[0];}if(i == 2){return cArray[0];}if(i == 3){return dArray[0];}return 0;}public String printSymbol(int i){if(i == 0){return " + ";}if(i == 1){return " - ";}if(i == 2){return " * ";}if(i == 3){return " / ";}return "";}} }