sinat_39806420的博客

#include #include #include #include #define MAX_NUM 100#define PRIME 97#define NOTEEXISTED NULL//利用链接表来处理冲突//定义数据结构typedef struct Person{ long id; char name[21]; struct Person

//p23页#include #include //奇数魔术方阵#define MAX 15void magic();int square[MAX][MAX];//矩阵最大15*15int N;//实际大小变量int main(){ int i, j; //读取矩阵大小，是个奇数，0-15之间 printf("\n输入矩阵大小： \n");

#include #include #define MAX 100void push();void pop();void list();char item[MAX][20];int top = -1;//堆栈的相关定义，插入删除输出操作的实现啊int main(){ char option; while(1) { printf(

//p55页#include #include #include #define MAX 20void intopostfix( char infix_q[], int rear);int compare( char stack_o, char infix_o );char infix_priority[9] = {'#', ')', '+', '-', '*', '/', '^',