Poj2488
题意:输入一个n*m的矩阵,行为1234....列为abcd....,让一个马不重复地走完整个矩阵,以字典序输出整个路径。
方法:穷举
因为是要以字典序输出,所以遍历的方式为
loc[i-1][j-2]
oc[i+1][j-2],
loc[i-2][j-1]
loc[i+2][j-1],
loc[i-2][j+1],
loc[i+2][j+1],
loc[i-1][j+2],
loc[i+1][j+2]
用一个一维数组来保存遍历结果,resu[i] = current_row * all_row + current_co;
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 8
int board[MAX][MAX];
int is_full(int* resu, int row, int col)
{
int i = 0;
for(i = row * col - 1; i > -1; i--)
{
if(*(resu + i) < 0)
{
return 0;
}
}
return 1;
}
void solve(int* resu, int n, int board[MAX][MAX], int row, int col, int curR, int curC)
{
int i = 0, j = 0;
if(curR < 0 || curR >= row || curC < 0 || curC >= col || board[curR][curC] != -1)
{
return;
}
board[curR][curC] = 1;
resu[n] = curR * col + curC;
solve(resu, n + 1, board, row, col, curR - 1, curC - 2);
solve(resu, n + 1, board, row, col, curR + 1, curC - 2);
solve(resu, n + 1, board, row, col, curR - 2, curC - 1);
solve(resu, n + 1, board, row, col, curR + 2, curC - 1);
solve(resu, n + 1, board, row, col, curR - 2, curC + 1);
solve(resu, n + 1, board, row, col, curR + 2, curC + 1);
solve(resu, n + 1, board, row, col, curR - 1, curC + 2);
solve(resu, n + 1, board, row, col, curR + 1, curC + 2);
if(!is_full(resu, row, col))
{
board[curR][curC] = -1;
resu[n] = -1;
}
}
int main()
{
freopen("input2488.txt", "r", stdin);
freopen("out2488.txt", "w", stdout);
int n, row, col, i, j, k, m, flag = 0;
int* resu = (int*)malloc(sizeof(int) * MAX * MAX);
scanf("%d", &n);
for(m = 1; m <= n; m++)
{
scanf("%d%d", &row, &col);
for(i = 0; i < row * col; i++)
{
flag = 0;
memset(board, -1, sizeof(int) * MAX * MAX);
memset(resu, -1, sizeof(int) * row * col);
solve(resu, 0, board, row, col, i / col, i % col);
if(is_full(resu, row, col))
{
flag = 1;
break;
}
}
printf("Scenario #%d:\n", m);
if(flag == 1)
for(k = 0; k < row * col; k++)
printf("%c%d", *(resu + k) % col + 'A', *(resu + k) / col + 1);
else if(flag == 0)
printf("impossible", n);
printf("\n\n");
}
return 0;
}