P1834 速算游戏

题目传送门

这道题实际是P1236 算24点的升级版，具体可见这里。

理论来说只需要改变输出即可:

#include<bits/stdc++.h>
using namespace std;

const int N = 1010;
int a[5];
string sans; //结果 
string ssx[5];
int k;

int count24(int a[], int n, string sx[]) //a[]储存数字，n记录步数，sx[]储存算式 
{
	int b[5] = {0};
	if(n == 1)
	{
		int x = 0, xx = 0; //x为结果，xx为结果下标 
		for(int i = 0; i < 4; i ++)
			if(a[i]) x = a[i], xx = i;
		if(x - 24 == 0)
		{
			sans = sx[xx];
			return 1;
		}
		else return 0;
	}
		
	string xs[5];
	for(int i = 0; i < 4; i ++)
		for(int j = 0; j < 4; j ++) //逐一枚举 
		{
			if(i == j) continue;
			if(!a[i] || !a[j]) continue;
			for(int k = 0; k < 4; k ++)
				b[k] = a[k], xs[k] = sx[k];
			string ii = sx[i], jj = sx[j];
			b[i] = a[i] * a[j];
			b[j] = 0;
			xs[i] = "(" + ii + "*" + jj + ")"; //组装结果 
			xs[j] = "";
			if(count24(b, n - 1, xs))
				return 1;
			b[i] = a[i] + a[j];
			b[j] = 0;
			xs[i] = "(" + ii + "+" + jj + ")";
			xs[j] = "";
			if(count24(b, n - 1, xs))
				return 1;
			b[i] = a[i] - a[j];
			b[j] = 0;
			xs[i] = "(" + ii + "-" + jj + ")";
			xs[j] = "";
			if(b[i] >= 0 && count24(b, n - 1, xs))
				return 1;
			if(a[j] && a[i] % a[j] == 0)
			{
				b[i] = a[i] / a[j];
				b[j] = 0;
				xs[i] = "(" + ii + "/" + jj + ")";
				xs[j] = "";
				if(count24(b, n - 1, xs))
					return 1;
			}
		}
	
	return 0;
}
int main()
{
	for(int i = 0; i < 4; i ++)	cin >> a[i];
	for(int i = 0; i < 4; i ++) ssx[i] = a[i] + '0';
	count24(a, 4, ssx);
	cout << sans << endl;
	
    return 0;
}

BUT，本题没有Special Judge（特判 

题目要求，取字典序最小的一个。

这里出示一下这些字符Ascii码排序：()+*-/0123456789。但c++中自带字典码比较（即>=<

我们需要一个数组存储已出现的非重复算式，并写一个find函数判重。如果重复返回false以防止死掉，否则存储并返回真。

find函数:
bool find(string s)
{
	for(int i = 0; i < k; i ++)
		if(ssa[i] == s) return true;
	return false;
}

判断:
//sx[]为传递过来的算式数组
//ssa[]为所有结果的存储数组
//smin为所有结果的最小值
int x = 0, xx = 0;
for(int i = 0; i < 4; i ++)
	if(a[i]) x = a[i], xx = i;
if(x - 24 == 0)
{
	int f = 1;
	string anss;
	anss = sx[xx];
	if(find(anss)) f = 0;
	else ssa[k ++] = anss;
	if(smin > anss) smin = anss;
	return f;
}
else return 0;

通过while(count24(a, 4, ssx)) ;进行循环获得算式，最后输出smin即可。

AC代码如下：

#include<bits/stdc++.h>
using namespace std;

const int N = 1010;
int a[5];
string ssx[5];
string smin = "9999999999999"; //求最小值，取最大值 
string ssa[N];
int k;

bool find(string s)
{
	for(int i = 0; i < k; i ++)
		if(ssa[i] == s) return true;
	return false;
}
int count24(int a[], int n, string sx[])
{
	int b[5] = {0};
	if(n == 1)
	{
		int x = 0, xx = 0;
		for(int i = 0; i < 4; i ++)
			if(a[i]) x = a[i], xx = i;
		if(x - 24 == 0)
		{
			int f = 1;
			string anss;
			anss = sx[xx];
			if(find(anss)) f = 0;
			else ssa[k ++] = anss;
			if(smin > anss) smin = anss;
			return f;
		}
		else return 0;
	}
		
	string xs[5];
	for(int i = 0; i < 4; i ++)
		for(int j = 0; j < 4; j ++)
		{
			if(i == j) continue;
			if(!a[i] || !a[j]) continue;
			for(int k = 0; k < 4; k ++)
				b[k] = a[k], xs[k] = sx[k];
			string ii = sx[i], jj = sx[j];
			b[i] = a[i] * a[j];
			b[j] = 0;
			xs[i] = "(" + ii + "*" + jj + ")";
			xs[j] = "";
			if(count24(b, n - 1, xs))
				return 1;
			b[i] = a[i] + a[j];
			b[j] = 0;
			xs[i] = "(" + ii + "+" + jj + ")";
			xs[j] = "";
			if(count24(b, n - 1, xs))
				return 1;
			b[i] = a[i] - a[j];
			b[j] = 0;
			xs[i] = "(" + ii + "-" + jj + ")";
			xs[j] = "";
			if(b[i] >= 0 && count24(b, n - 1, xs))
				return 1;
			if(a[j] && a[i] % a[j] == 0)
			{
				b[i] = a[i] / a[j];
				b[j] = 0;
				xs[i] = "(" + ii + "/" + jj + ")";
				xs[j] = "";
				if(count24(b, n - 1, xs))
					return 1;
			}
		}
	
	return 0;
}
int main()
{
	for(int i = 0; i < 4; i ++)	cin >> a[i];
	for(int i = 0; i < 4; i ++) ssx[i] = a[i] + '0';
	while(count24(a, 4, ssx)) ;
	cout << smin << endl;
	
    return 0;
}

完结懒得撒花*★,°*:.☆(￣▽￣)/$:*.°★* 。