24点游戏游戏(C++)

本文介绍了如何使用C++编程实现经典的24点游戏算法。通过解析给定的四个数字,运用加减乘除及括号操作,判断是否能得出24。内容涵盖了数字组合、算术运算及递归思想的应用。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

#include<bits/stdc++.h>
using namespace std;
int card[] = { 1,2,3,4,5,6,7,8,9,10,11,12,13 };
int nums[4];
char ope[4] = { '+','-','*','/' };
 
 
double calcute(double a, double b, char index)
{
	if (index == '+') return a + b;  
	else if (index == '-') return a - b;
	else if (index == '*') return a*b;
	else if (index == '/')
		if (b != 0)
			return a / b;
}


int main()
{
	int i = 0;
	int j;
	cout << "生成的四张牌面为:";
	srand((unsigned)time(0));
	for (i = 0; i<4; i++)
	{
	     j =rand() % 13 ;
		nums[i] = card[j];
	}
	cout << nums[0] << ";" << nums[1] << ";" << nums[2] << ";" << nums[3] << "。" << endl;
	double  temp[3], tem[2];
	double  sum; 
	int  judge = 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 < 3; m++)
				{
					if (nums[m + 1] == 0 && ope[i] == '/') break;
					temp[m] = calcute(nums[m], nums[m + 1], ope[i]);
					temp[(m + 1) % 3] = nums[(m + 2) % 4];
					temp[(m + 2) % 3] = nums[(m + 3) % 4];     
					for (int n = 0; n < 2; n++)
					{
						if (temp[n + 1] == 0 && ope[j] == '/') break;
						tem[n] = calcute(temp[n], temp[n + 1], ope[j]);
						tem[(n + 1) % 2] = temp[(n + 2) % 3];    
						if (tem[1] == 0 && ope[k] == '/') break;
						sum = calcute(tem[0], tem[1], ope[k]);             
						if (sum == 24)    
						{
							judge = 1;       
							if (m == 0 && n == 0)
								cout << "((" << nums[0] << ope[i] << nums[1] << ")" << ope[j] << nums[2] << ")" << ope[k] << nums[3] << "=" << sum << endl;
							else if (m == 0 && n == 1)
								cout << "(" << nums[0] << ope[i] << nums[1] << ")" << ope[k] << "(" << nums[2] << ope[j] << nums[3] << ")=" << sum << endl;
							else if (m == 1 && n == 0)
								cout << "(" << nums[0] << ope[j] << "(" << nums[1] << ope[i] << nums[2] << ")" << ope[k] << nums[3] << "=" << sum << endl;
							else if (m == 1 && n == 1)
								cout << nums[0] << ope[k] << "((" << nums[1] << ope[i] << nums[2] << ")" << ope[j] << nums[3] << ")=" << sum << endl;
							else if (m == 2 && n == 0)
								cout << "(" << nums[0] << ope[j] << nums[1] << ")" << ope[k] << "(" << nums[2] << ope[i] << nums[3] << ")=" << sum << endl;
							else if (m == 2 && n == 0)
								cout << nums[0] << ope[k] << "(" << nums[1] << ope[j] << "(" << nums[2] << ope[i] << nums[3] << "))=" << sum << endl;
						}
					}
				}
			}
		}
	}
	if (judge == 0)
		cout << "这四张扑克牌无法找到一个合理的解" << endl;
	return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值