24点游戏c++，穷举法

采用的是穷举法，所以有点麻烦
关键是在于这个点
他有五种情况下的运算方式
加减乘除就没有加进去了
//(AB)(CD)
//(A(BC))D
//((AB)C)D
//A(B(CD))
//A((BC)D)
计算了一下一共大概有 ：
3^3（三个运算符）*5（五种括号运算情况）*4！（4的阶层中数字摆放顺序）

ps：在进行运算的时候己得顺序不能反
因为运算的函数是确定的，如果换顺序会错误
eg： r1=haha( a , s ,op1)！= r1=haha( s , a ,op1)

下面是代码的实现，里面可能有一些对不上

#include <stdio.h>

#include <iostream>
using namespace std;
const char lala[5] = { '@','+','-','*','/', };

double haha(double x, double y, int asd)//这里是对应加减乘除
{
	switch (asd)
	{
	case 1:
		return x + y;
	case 2:
		return x - y;
	case 3:
		return x * y;
	case 4:
		return x / y;
	default:
		return 0.0;
	}
}

//这里写的是对应不同的模板
//((as)d)f
double yi(double a, double s, double d, double f, int op1, int op2, int op3)
{
	double r1, r2, r3;
	r1 = haha(a, s, op1);
	r2 = haha(r1, d, op2);
	r3 = haha(r2, f, op3);
	return r3;
}
//(A(BC))D
double er(double a, double s, double d, double f, int op1, int op2, int op3)
{
	//1111111
	double r1, r2, r3;
	r1 = haha(s, d, op2);
	r2 = haha(a, r1, op1);
	r3 = haha(r2, f, op3);
	return r3;
}
//A(B(CD)).
double san(double a, double s, double d, double f, int op1, int op2, int op3)
{
	double r1, r2, r3;
	r1 = haha(d, f, op3);
	r2 = haha(s, r1, op2);
	r3 = haha(a, r2, op1);
	return r3;
}
//a((sd)f)
double si(double a, double s, double d, double f, int op1, int op2, int op3)
{
	double r1, r2, r3;
	r1 = haha(s, d, op2);
	r2 = haha(r1, f, op3);
	r3 = haha(a, r2, op1);
	return r3;
}
//(as)(df)
double wu(double a, double s, double d, double f, int op1, int op2, int op3)
{
	double r1, r2, r3;
	//(AB)(CD)
	//meiyouwenti
	r1 = haha(a, s, op1);
	r2 = haha(d, f, op3);
	r3 = haha(r1, r2, op2);
	return r3;
}

double get24(double a, double s, double d, double f)
{
	int flag = 0;
	for (int i = 1; i <= 4; ++i)//三重循环穷举运算符
	{
		for (int j = 1; j <= 4; ++j)
		{
			for (int k = 1; k <= 4; ++k)
			{
				if (yi(a, s, d, f, i, j, k) == 24.0)
				{
					//((as)d)f
					printf("((%.0f%c%.0f)%c%.0f)%c%.0f=24\n", a, lala[i], s, lala[j], d, lala[k], f);
					flag = 1;
					return flag;
				}
				if (er(a, s, d, f, i, j, k) == 24.0)
				{
					//(A(BC))D
					printf("(%.0f%c(%.0f%c%.0f))%c%.0f=24\n", a, lala[i], s, lala[j], d, lala[k], f);
					flag = 1;
					return flag;
				}
				if (san(a, s, d, f, i, j, k) == 24.0)
				{
					//A(B(CD)).
					printf("%.0f%c(%.0f%c(%.0f%c%.0f))=24\n", a, lala[i], s, lala[j], d, lala[k], f);
					flag = 1;
					return flag;
				}
				if (si(a, s, d, f, i, j, k) == 24.0)
				{
					//a((sd)f)
					printf("(%.0f%c((%.0f%c%.0f)%c%.0f)=24\n", a, lala[i], s, lala[j], d, lala[k], f);
					flag = 1;
					return flag;
				}

				if (wu(a, s, d, f, i, j, k) == 24.0)
				{
					//(as)(df)
					printf("(%.0f%c%.0f)%c(%.0f%c%.0f)=24\n", a, lala[i], s, lala[j], d, lala[k], f);
					flag = 1;
					return flag;
				}
			}
		}
	}
	return flag;
}


int main()
{
	double sz[5];
	double x=0;
	while (true)
	{
		x = 0;
		cin >> sz[1] >> sz[2] >> sz[3] >> sz[4];
		//scanf("%lf%lf%lf%lf", &sz[1], &sz[2], &sz[3], &sz[4]);
		for (int i = 1; i <= 4; i++)//穷举运算数组的全排列
		{
			for (int j = 1; j <= 4; j++)
			{
				if (j != i)
					for (int k = 1; k <= 4; k++)
					{
						if (k != j && k != i)
							for (int l = 1; l <= 4; l++)
							{
								if (l != k && l != j && l != i)
								{
									x= get24(sz[i], sz[j], sz[k], sz[l]);
									if (x == 1)
										break;
								}
									
							}
						if (x == 1)
							break;
					}
				if (x == 1)
					break;
			}
			if (x == 1)
				break;
		}
	}
	
	return 0;
}

这个是强行算出来的没有上面很大的意义，更多的是细节