华为机试题：24点游戏

今天药忘吃喽~ 2022-08-20 05:19 190阅读 0赞

/******************************************************************************
    
    Copyright (C), 2001-2013, Huawei Tech. Co., Ltd.
    
    ******************************************************************************
    File Name     :
    Version       :
    Author        :
    Created       : 2013/03/12
    Last Modified :
    Description   :
    Function List :
    
    History       :
    1.Date        : 2013/03/12
    Author      :
    Modification: Created file
    
    ******************************************************************************/
    #include <stdlib.h>
    #include <string.h>
    #include <stdio.h>
    #include <algorithm>
    #include <vector>
    
    using namespace std;
    
    /*遍历所有的情况
    (((a op1 b) op2 b ) op3 d)  op1,op2,op3可以分别为 + - * /
    */
    int checkIsOk(int a, int b, int c, int d)
    {
    	if (a + b + c + d == 24)         return 1;
    	else if (a + b + c - d == 24)   return 1;
    	else if ((a + b)*(c + d) == 24) return 1;
    	else if ((a - b)*(c + d) == 24)  return 1;
    	else if ((a - b)*(c - d) == 24)   return 1;
    	else if ((a + b + c)*d == 24)return 1;	
    	else if ((a + b - c)*d == 24)return 1;	
    	else if ((a - b - c)*d == 24)return 1;	
    	else if ((a*b*c) / d == 24)return 1;	
    	else if ((a*b)*(c - d) == 24)return 1;	
    	else if ((a*b)*c - d == 24)return 1;	
    	else if ((a*b)*c + d == 24)return 1;		
    	else if (a*b*c*d == 24)return 1;	
    	else if ((a + b)*(c / d) == 24)return 1;	
    	else if ((a + b) + (c / d) == 24)return 1;	
    	else if ((a*b) + c + d == 24)return 1;	
    	else if ((a*b) + c - d == 24)return 1;	
    	else if ((a*b) - (c / d) == 24)return 1;
    	else if ((a*b) + (c / d) == 24)return 1;
    	else if ((a*b) - c - d == 24)return 1;		
    	else if ((a*b) + (c*d) == 24)return 1;		
    	else if ((a*b) - (c*d) == 24)return 1;		
    	else if ((a*b) / (c*d) == 24)return 1;		
    	else if ((a*b) / (c + d) == 24)return 1;		
    	else if (c != d)
    	if ((a*b) / (c - d) == 24)return 1;			
    	else	return 0;
    	return 0;
    }
    
    bool Game24Points(int a, int b, int c, int d)
    {
    	vector<int> vec;
    
    	vec.push_back(a);
    	vec.push_back(b);
    	vec.push_back(c);
    	vec.push_back(d);
    
    	/*用STL容器的next_permutation全排列算法来求解*/
    	while (next_permutation(vec.begin(), vec.end()))
    	{
    		if (checkIsOk(vec[0], vec[1], vec[2], vec[3]) == 1)
    		{
    			return true;
    		}
    	}
    
    	return false;
    }