24点计算器（有缺陷，勿喷！！！！）

追求完美的不完美主义者

已于 2024-04-04 21:26:31 修改

阅读量120

点赞数 1

分类专栏： C++ 文章标签： c++ 图论

于 2023-04-16 14:42:04 首次发布

本文链接：https://blog.csdn.net/back_room/article/details/130182455

版权

C++ 专栏收录该内容

24 篇文章 0 订阅

订阅专栏


#include <iostream>
#include <string>
#include <cmath>
#include<stdlib.h>
using namespace std;
 
const  double  PRECISION = 1E-6;
const  int  COUNT_OF_NUMBER  = 4;
const  int  NUMBER_TO_BE_CAL = 24;
double  number[COUNT_OF_NUMBER];
string  expression[COUNT_OF_NUMBER];
bool Judgement = false;                    
int count = 0;
 
void  Search(int   n) {
	if (n   ==   1) {
		if ( fabs(number[0] - NUMBER_TO_BE_CAL) <= PRECISION   ) { 
			cout << expression[0] << "\t\t";
			Judgement = true;
			count ++;
			if((count % 3)==0)
				cout<<endl;
		} else {
		}
 
	}
 
	for(int i=0;  i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			double   a,   b;
			string   expa,   expb;
			a   =   number[i];
			b   =   number[j];
			number[j]  =  number[n - 1];   
			expa   =   expression[i];
			expb   =   expression[j];
			expression[j]  =  expression[n - 1];   
			expression[i]   =   '('   +   expa   +   '+'   +   expb   +   ')';  
			number[i]   =   a   +   b;
			Search(n-1);
			expression[i]   =   '('   +   expa   +   '-'   +   expb   +   ')';  
			Search(n-1);
			expression[i]   =   '('   +   expb   +   '-'   +   expa   +   ')';   
			number[i]   =   b   -   a;
			Search(n-1);
			expression[i]   =   '('   +   expa   +   '*'   +   expb   +   ')';  
			number[i]   =   a   *   b;
			Search(n-1);
			if (b != 0) {
				expression[i]   =   '('   +   expa   +   '/'   +   expb   +   ')';   
				number[i] = a / b;
				Search(n-1);
			}
			if (a != 0) {
				expression[i]   =   '('   +   expb   +   '/'   +   expa   +   ')';
				number[i]   =   b  /  a;
				Search(n-1);
			}
 
			number[i]   =   a;                  
			number[j]   =   b;                  
			expression[i]   =   expa;           
			expression[j]   =   expb;           
		}
	}
}
 
int  main() {
	cout<<"Please enter the 4 numbers in sequence:\n";
	for (int i = 0; i < COUNT_OF_NUMBER; i++) {
		char   buffer[20];
		cout<<"sequence"<<i+1<<"card:";
		cin   >>   number[i];
		itoa(number[i],   buffer,   10);  

		expression[i]   =   buffer;
	}
	cout<<endl;
	Search(COUNT_OF_NUMBER) ;
	if(Judgement==true) {
		cout   <<   "successes\n"   <<   endl;
		cout<<"So the total number of times it can be calculated = "<<count<<endl;
	} else {
		cout   <<   " reversal"   <<   endl;
	}
	system("pause");
	return 0;
}