LiuXingLong

#include#include // malloc() 函数的头文件typedef int TElemType;typedef struct BiTNode{ TElemType data; // 所建链表结点结构 struct BiTNode *lchild,*rchild;}BiTNode,*BiTree;void Createbit

#include #include#include using namespace std;#define MAXSIZE 5 // 元素个数typedef int SElemType; //定义 SElemType 类型typedef int Status;SElemType e;typedef struct // 定义栈{ SElemType *

#include#include // malloc() 函数的头文件struct node *p = NULL, *p1 = NULL, *head = NULL ;struct node{ int a; // 所建链表结点结构 struct node *next;}; void scan() // 输入数据{ int b;

#include#include #include#include#includeusing namespace std;queueq;int main(){ int a, n; scanf("%d", &n); for (int i = 1; i <= n; i++) { scanf("%d", &a); q.push(a); } for (int i = 1

#include#include #include#include#include#define true 1#define MVNum 100010 //最多定点数using namespace std;queueQ;int visited[MVNum];typedef int VerTexType;typedef struct ArcNode // 边结点{

//大数模板#include#include#include#includeusing namespace std;const int SIZE = 7;//  不允许更改const int mod = 1000000000;#define ll long long#define N  1000struct bignum    //    结构体