HDU 5612 dfs

#include <cstdio>
#include <cmath>
#include <cstring>
const int maxn = 100 + 10;
const double eps = 1E-8;
const int dir[][2] = {1, 0, 0, 1, -1, 0, 0, -1};
char str[maxn][maxn];
bool vis[maxn][maxn];
int n, m, T;
double sum;
int dcmp(double x)
{
	if (fabs(x) < eps) return 0;
	else return fabs(x) < 0 ? -1 : 1;
}
int dfs(int x, int y, double Tsum)
{
	if (!dcmp(Tsum - sum)) return 1;
	else
	{
		vis[x][y] = 1;
		for (int i = 0; i < 4; i++)
		{
			int Tx = x + dir[i][0] * 2, Ty = y + dir[i][1] * 2;
			if (Tx >= 0 && Tx < n && Ty >= 0 && Ty < m && !vis[Tx][Ty])
			{
				int num = str[Tx][Ty] - '0';
				char c = str[Tx - dir[i][0]][Ty - dir[i][1]];
				if (c == '+') if (dfs(Tx, Ty, Tsum + num)) return 1;
				if (c == '-') if (dfs(Tx, Ty, Tsum - num)) return 1;
				if (c == '*') if (dfs(Tx, Ty, Tsum * num)) return 1;
				if (c == '/' && num) if (dfs(Tx, Ty, Tsum / num)) return 1;
			}
		}
		vis[x][y] = 0;
		return 0;
	}
}
int main(int argc, char const *argv[])
{
	scanf("%d", &T);
	while (T--)
	{
		memset(vis, 0, sizeof(vis));
		scanf("%d%d%lf", &n, &m, &sum);
		for (int i = 0; i < n; i++)
			scanf("%s", str[i]);
		int cnt = 0;
		for (int i = 0; i < n && !cnt; i += 2)
			for (int j = 0; j < m && !cnt; j += 2)
				cnt = dfs(i, j, str[i][j] - '0');
		printf("%s\n", cnt ? "Possible" : "Impossible");
	}
	return 0;
}

矩阵内是否可以找到一个表达式的值等于sum

搜索所有表达式，暴力即可。