poj 2488A Knight's Journey

Description

Background 
The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey
around the world. Whenever a knight moves, it is two squares in one direction and one square perpendicular to this. The world of a knight is the chessboard he is living on. Our knight lives on a chessboard that has a smaller area than a regular 8 * 8 board, but it is still rectangular. Can you help this adventurous knight to make travel plans? 

Problem 
Find a path such that the knight visits every square once. The knight can start and end on any square of the board.

Input

The input begins with a positive integer n in the first line. The following lines contain n test cases. Each test case consists of a single line with two positive integers p and q, such that 1 <= p * q <= 26. This represents a p * q chessboard, where p describes how many different square numbers 1, . . . , p exist, q describes how many different square letters exist. These are the first q letters of the Latin alphabet: A, . . .

Output

The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the lexicographically first path that visits all squares of the chessboard with knight moves followed by an empty line. The path should be given on a single line by concatenating the names of the visited squares. Each square name consists of a capital letter followed by a number. 
If no such path exist, you should output impossible on a single line.

Sample Input

3
1 1
2 3
4 3

Sample Output

Scenario #1:
A1

Scenario #2:
impossible

Scenario #3:
A1B3C1A2B4C2A3B1C3A4B2C4

马从棋盘上的(1, 1)点出发（棋盘大小为p*q），问存不存在一条路，使得马能够遍历一遍棋盘上所有的点仅且一次。如果存在，输出遍历时所走的路径；如果有多条，输出字典序最小的那一条。

#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
int dir[8][2]={{-1,-2},{1,-2},{-2,-1},{2,-1},{-2,1},{2,1},{-1,2},{1,2}};  //注意顺序
int n,m;
bool flag;
int step=0;
bool visit[30][30];
struct node
{
    int i;
    int j;
}num[27*27];
bool judge(int i,int j)
{
    if(flag&&i>=0 && i<n && j>=0 && j<m && !visit[i][j])
    {
        return true;
    }
    return false;
}
void dfs(int x,int y,int cnt)
{
    num[cnt].i=x;
    num[cnt].j=y;
    visit[x][y]=true;
    if(cnt==n*m && flag)
    {
        step=cnt;
        flag=false;
        return;
    }
    for (int i=0; i<8; i++)
    {
        int pos_x=x+dir[i][0];
        int pos_y=y+dir[i][1];
        if(judge(pos_x,pos_y))
        {
            dfs(pos_x, pos_y,cnt+1);
        }
    }
    visit[x][y]=false;
    return;
}
int main()
{
    int ans;
    scanf("%d",&ans);
    for(int k=1;k<=ans;k++)
    {
        scanf("%d%d",&n,&m);
        flag=true;
        step=0;
        memset(visit,false, sizeof(visit));
        dfs(0,0,1);
        cout<<"Scenario "<<"#"<<k<<":"<<endl;
        if (flag)
        {
            cout<<"impossible"<<endl<<endl;
        }
        else
        {
            for (int i=1; i<=step; i++)
            {
                cout<<(char)(num[i].j+'A')<<num[i].i+1;
            }
            cout<<endl<<endl;
        }
    }
    return 0;
}