问题描述:
速算24点相信绝大多数人都玩过。就是随机给你四张牌,包括A(1),2,3,4,5,6,7,8,9,10,J(11),Q(12),K(13)。要求只用’+’,’-‘,’*’,’/’运算符以及括号改变运算顺序,使得最终运算结果为24(每个数必须且仅能用一次)。游戏很简单,但遇到无解的情况往往让人很郁闷。你的任务就是针对每一组随机产生的四张牌,判断是否有解。我们另外规定,整个计算过程中都不能出现小数。
输入:
每组输入数据占一行,给定四张牌。
输出:
如果有解,则输出一种可行的解决方案(参看输出样例),否则输出NO SOLUTION
输入样例:
A 2 3 6
3 3 8 8
输出样例
参看代码:
#include<stdio.h>
char str[4][3];
int arrCard[4];
int IsFindSolution(int n, int step, char solution[3][20])
{
int i, j, k, nTemp1, nTemp2;
if (1 == n)//到这里已经算出最后结果了
{
if (24 == arrCard[0])
{
for (k = 0; k < 3; k++)
printf("步骤%d: %s\n", k + 1, solution[k]);
return 1;
}
else
return 0;
}
for (i = 0; i < n; i++)
{
for (j = i + 1; j < n; j++)
{
nTemp1 = arrCard[i];
nTemp2 = arrCard[j];
arrCard[j] = arrCard[n - 1];
arrCard[i] = nTemp1 + nTemp2;
sprintf_s(solution[step - 1], 20, "%d + %d = %d", nTemp1, nTemp2, nTemp1 + nTemp2);
if (IsFindSolution(n - 1, step + 1, solution)) return 1;
arrCard[i] = nTemp1 - nTemp2;
sprintf_s(solution[step - 1], 20, "%d - %d = %d", nTemp1, nTemp2, nTemp1 - nTemp2);
if (IsFindSolution(n - 1, step + 1, solution)) return 1;
arrCard[i] = nTemp2 - nTemp1;
sprintf_s(solution[step - 1], 20, "%d - %d = %d", nTemp2, nTemp1, nTemp2 - nTemp1);
if (IsFindSolution(n - 1, step + 1, solution)) return 1;
arrCard[i] = nTemp1 * nTemp2;
sprintf_s(solution[step - 1], 20, "%d * %d = %d", nTemp1, nTemp2, nTemp1 * nTemp2);
if (IsFindSolution(n - 1, step + 1, solution)) return 1;
if (nTemp1 && nTemp2 % nTemp1 == 0)
{
arrCard[i] = nTemp2 / nTemp1;
sprintf_s(solution[step - 1], 20, "%d / %d = %d", nTemp2, nTemp1, nTemp2 / nTemp1);
if (IsFindSolution(n - 1, step + 1, solution)) return 1;
}
if (nTemp2 && nTemp1 % nTemp2 == 0)
{
arrCard[i] = nTemp1 / nTemp2;
sprintf_s(solution[step - 1], 20, "%d / %d = %d", nTemp1, nTemp2, nTemp1 / nTemp2);
if (IsFindSolution(n - 1, step + 1, solution)) return 1;
}
arrCard[i] = nTemp1;
arrCard[j] = nTemp2;
}
}
return 0;
}
int ChangeCardPoint(char* str)
{//把输入的字符串转成整数
if (0 == stricmp(str, "A"))
return 1;
if (0 == stricmp(str, "10"))
return 10;
if (0 == stricmp(str, "J"))
return 11;
if (0 == stricmp(str, "Q"))
return 12;
if (0 == stricmp(str, "K"))
return 13;
return str[0] - '0';
}
int main()
{
char solution[3][20];
int i = 0;
while (scanf_s("%s%s%s%s", str[0], 3, str[1], 3, str[2], 3, str[3], 3) == 4)
{
for (i = 0; i < 4; i++)
arrCard[i] = ChangeCardPoint(str[i]);
if (IsFindSolution(4, 1, solution));
else
printf("NO SOLUTION\n");
}
return 0;
}