数据结构中马踏棋盘代码

#include<stdio.h>
#include<stdlib.h>

typedef Location{                              //位置定义
    int lie;
    int hang;
}Location;

typedef struct{
    int  elem[][];
    int  Location;
}QpList;

Status InitList_Qp(QpList &L,int i,int j){
    for(i=0;i<8;i++){
        for(j=0;j<8;j++){
            L.elem[i][j]=(int*)malloc(sizeof(int));
            L.elem[i][j]=0;
        }
    }
}InitList_Qp;

int HTry1[8]={-2,-1,1,2,2,1,-1,-2};
int HTry2[8]={1,2,2,1,-1,-2,-2,-1};

Status InQp(int Location,int h){
    if((Location.hang+HTry1[h])>=0&&(Location.hang+HTry1[h])<=7)
      if((Location.lie+HTry2[h])>=0&&((Location.lie+HTry2[h])<=7) return 1;
    return 0;
}InQp;