A - A Knight's Journey
src="https://vjudge.net/problem/description/8025?1515752285000" width="100%" height="1342px" frameborder="0" scrolling="no" style="box-sizing: inherit;">
//注意字典序问题!!!
//int dir[8][2]={-1, -2, 1, -2, -2, -1, 2, -1, -2, 1, 2, 1, -1, 2, 1, 2};
#include<stdio.h>
#include<string.h>
int p, q, flag, book[30][30];
char a[30][2];
int dir[8][2]={-1, -2, 1, -2, -2, -1, 2, -1, -2, 1, 2, 1, -1, 2, 1, 2};
void dfs(int cur, int x, int y)
{
int k, tx, ty;
if(cur==p*q)
{
flag=1;
return ;
}
if(flag)
return ;
for(k=0;k<8;k++)
{
tx=x+dir[k][0];
ty=y+dir[k][1];
if(tx<0 || tx>=p || ty<0 || ty>=q || book[tx][ty])
continue ;
book[tx][ty]=1;
a[cur][0]=ty+'A';
a[cur][1]=tx+'1';
dfs(cur+1, tx, ty);
if(flag)
return ;
a[cur][0]=0;
a[cur][1]=0;
book[tx][ty]=0;
}
}
int main()
{
int t, n, i, j, temp, ca=0;
scanf("%d", &t);
while(t--)
{
flag=0;
memset(book, 0, sizeof(book));
memset(a, 0, sizeof(a));
scanf("%d%d", &p, &q);
a[0][0]='A';
a[0][1]='1';
book[0][0]=1;
if(p*q!=1)
dfs(1, 0, 0);
printf("Scenario #%d:\n", ++ca);
if(flag || p*q==1)
for(i=0;i<p*q;i++)
for(j=0;j<2;j++)
printf("%c", a[i][j]);
else
printf("impossible");
printf("\n");
if(t)
printf("\n");
}
return 0;
}