POJ 3050 Hopscotch

POJ 3050题目大意如下：

这也是一道暴力搜索，直接DFS，代码如下

#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>

using namespace std;
int dirX[] = {0, 1, 0, -1};
int dirY[] = {1, 0, -1, 0};
int Grap[6][6];

int sum;
map<int, int> data;
void dfs(int i, int j, int flag, int test) {
if (flag == 6) {
if (data[test] == 0) data[test] = ++sum;
return;
}
test = test*10 + Grap[i][j];
for (int k = 0; k < 4; k++) {
int x = i + dirX[k], y = j + dirY[k];
if (x >= 5 || x < 0 || y >= 5 || y < 0) continue;
dfs(x, y, flag + 1, test);
}
}

void solve() {
sum = 0;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
dfs(i, j, 0, 0);
}
}
printf("%d\n", sum);
}

int main(int argc, const char * argv[]) {
// insert code here...
memset(Grap, 0, sizeof(Grap));
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
scanf("%d", &Grap[i][j]);
}
}
solve();
return 0;
}