Sicily1152 马周游问题

深搜即可没什么难度

// Problem#: 1152
// Submission#: 2755459
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <cstdio>
#include <cstring>
char dir[][2]={{-1,-2},{-2,-1},{-2,1},{-1,2},{1,2},{2,1},{2,-1},{1,-2}};
int vis[10][10];
int road[35];
bool IsInMap(int row,int column){
    return row>=0&&row<5&&column>=0&&column<6;
} 
void dfs(int row,int column,int cur){
    vis[row][column] = 1;
    road[cur] = row * 6 + column + 1;
    if(cur==29)
        return ;
    for(int i = 0;i < 8;i++){
        int new_row = row + dir[i][0];
        int new_column = column + dir[i][1];
        if(IsInMap(new_row,new_column)&&!vis[new_row][new_column])
            dfs(new_row,new_column,cur + 1);
    }
    if(!road[cur + 1]){
        vis[row][column] = 0;
        road[cur] = 0;
    }
}
int main()
{
    int row,column,start;
    while(scanf("%d",&start)&&start!=-1){
        memset(vis,0,sizeof(vis));
        memset(road,0,sizeof(road));
        row = start / 6 ;
        column = start % 6 - 1;
        dfs(row,column,0);
        for(int i = 0;i < 30;i++){
            if(!i)
                printf("%d",road[i]);
            else
                printf(" %d",road[i]);
        }
        printf("\n");
    }
}