C++计算24点 (乱写的)

#include<iostream>
using namespace std;
#include<vector>

#include<sstream>
#define num 4
#include<unordered_set>
vector<double> source(num);
vector<string>path;
//vector<vector<string>>res;
vector<bool> used(num + 3, false);
static int counter = 1;
void calcurate24(int n) {
	if (path.size() == 3) {
		if (abs(source.back() - 24) < 0.0000001) {

			cout << "way" << counter++ << ":" << endl;
			for (int i = 0; i < 3; i++)
				cout << path[i] << endl;
		}
		return;
	}
	unordered_set<int> inum;

	for (int i = 0; i < source.size() - 1; i++) {
		if (used[i] || inum.count(source[i])) continue;
		unordered_set<int> jnum;
		for (int j = i + 1; j < source.size(); j++) {
			if (used[j] || jnum.count(source[j])) continue;

			inum.insert(source[i]);
			jnum.insert(source[j]);
			double a = source[i], b = source[j];
			used[i] = true;
			used[j] = true;

			///
			if (b != 1 && b != 0 /*&& 1.0 * a / b == a / b*/) {
				source.push_back(1.0 * a / b);
				ostringstream ost6;
				ost6 << a << '/' << b;
				path.push_back(ost6.str());
				calcurate24(n - 1);
				path.pop_back();
				source.pop_back();
			}
			if (a != 1 && a != 0 /*&& 1.0 * b / a == b / a*/) {
				source.push_back(1.0 * b / a);
				ostringstream ost5;
				ost5 << b << '/' << a;
				path.push_back(ost5.str());
				calcurate24(n - 1);
				path.pop_back();
				source.pop_back();
			}


			//-
			source.push_back(a - b);
			ostringstream ost2;
			ost2 << a << '-' << b;
			path.push_back(ost2.str());
			calcurate24(n - 1);
			path.pop_back();
			source.pop_back();

			source.push_back(b - a);
			ostringstream ost3;
			ost3 << b << '-' << a;
			path.push_back(ost3.str());
			calcurate24(n - 1);
			path.pop_back();
			source.pop_back();
			//+

			source.push_back(a + b);
			ostringstream ost1;
			ost1 << a << '+' << b;
			path.push_back(ost1.str());
			calcurate24(n - 1);
			path.pop_back();
			source.pop_back();



			//*
			source.push_back(b * a);
			ostringstream ost4;
			ost4 << a << '*' << b;
			path.push_back(ost4.str());
			calcurate24(n - 1);
			path.pop_back();
			source.pop_back();



			used[i] = false;
			used[j] = false;
		}
	}



}

int main() {
	while (true) {
		cout << "请输入4个整数数字:" << endl;
		path.clear();
		for (int j = 0; j < used.size(); j++) {
			used[j] = false;
		}
		for (int i = 0; i < num; i++) {
			cin >> source[i];
		}
		counter = 1;
		calcurate24(4);
		if (counter == 1)cout << "no way" << endl;
		system("pause");
		system("cls");
	}


	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值