poj 3050 Hopscotch

对每一个点进行一次dfs

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <climits>
#include <ctype.h>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <deque>
#include <set>
#include <map>
#include <iostream>
#include <algorithm>

#define mst(a,b) memset(a,b,sizeof(a));

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int MAXN = 1000001;

int n;
int grid[5][5];
set<int> s;

void dfs(int x, int y, int hop, int cur){
    if(x < 0 || x > 4 || y < 0 || y > 4)
        return;
    if(hop == 6){
        s.insert(cur);
    }
    else{
        cur *= 10;
        cur += grid[x][y];
        dfs(x+1, y, hop+1, cur);
        dfs(x-1, y, hop+1, cur);
        dfs(x, y+1, hop+1, cur);
        dfs(x, y-1, hop+1, cur);
    }
}

int main()
{
    for(int i = 0; i < 5; i++)
        for(int j = 0; j < 5; j++)
            cin >> grid[i][j];
    // brute force
    for(int i = 0; i < 5; i++){
        for(int j = 0; j < 5; j++){
            dfs(i,j,0,0);
        }
    }
    cout << s.size() << endl;	
    return 0;
}