最简洁马走日c程序回溯打印所有能走通路径

#include
#define N 5
int qipan[N][N]={0};                                        //初始化棋盘 
static int jishu;                                         //规定jishu为种数 
void zoubu（int xint y）{                                    // 递归函数 
    static int a=1;                                         //a表示步数 
	int ij;
	if（（x>=0&&x=0&&y		qipan[x][y]=a++;                                    //输入当前步数 
		if（a==（N*N）+1）{                                     //a=N*N+1时表示已经走了25步（已经走完棋盘）输出结果 
			printf（“第%d种\n“++jishu）;