UVA 10344 算23点

回溯法和深度优先搜索的运用

我在想任給4个数算24点的传统问题这么解应该如何写呢？

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
///
#define INF 0xffffff7
#define MAXN 30
int num[5];
bool flag;
bool vis[5];
void dfs(int cur, int val)
{
	if (cur == 5 && val == 23)
	{
		flag = true;
		return;
	}
	int i;
	for (i = 0; i < 5; i++)
	{
		if (!vis[i])
		{
			vis[i] = true;
			dfs(cur + 1, val + num[i]);
			dfs(cur + 1, val - num[i]);
			dfs(cur + 1, val * num[i]);
			vis[i] = false;
		}
	}
}

int main()
{	///
	int i, j;
	while (1)
	{
		for (i = 0; i < 5; i++)
			cin >> num[i];
		if (num[0] == 0)
			break;
		
		flag = false;
		for (i = 0; i < 5; i++)
		{
			memset(vis, false, sizeof(vis));
			vis[i] = true;
			dfs(1, num[i]);
		}
		if (flag)
			cout << "Possible" << endl;
		else
			cout << "Impossible" << endl;
	}
    
	///
    return 0;
}