-
Magio牛的usaco源代码,希望和大家共同学习
Magio牛的usaco源代码,希望和大家共同学习-Magio cattle usaco source code, hope and common learning
- 2022-04-07 10:46:33下载
- 积分:1
-
A Score ranking
程序读取所有;
- 2022-01-26 01:12:29下载
- 积分:1
-
一元多项式乘法 包含密运算
新学数据结构的可以参考参考 ...
一元多项式乘法 包含密运算
新学数据结构的可以参考参考 -One dollar secret polynomial multiplication operations include the new data structure can refer to reference
- 2022-07-17 11:13:18下载
- 积分:1
-
vb实现最短路径Dijkstra算法,很经典的算法。
vb实现最短路径Dijkstra算法,很经典的算法。-vb realize Dijkstra shortest path algorithm, it is the classic algorithms.
- 2022-07-06 18:38:36下载
- 积分:1
-
This is an operating system used to manage a permission procedure, it increases...
这是一个用来管理一个运行系统权限的程序,它增加删除用户,也可修改用户的密码和权限-This is an operating system used to manage a permission procedure, it increases delete users can modify user passwords and permissions
- 2022-01-22 16:54:44下载
- 积分:1
-
数据结构——链表(双向循环链表)
双向循环链表节点:数据域+指针域指针域:一个指针指向前一个同类型节点,另一个指针指向后一个同类型节点(1)设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};(2)创建空链表//创建了一个只有头节点的双向循环链表,返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}(3)制造新节点//制造新节点,返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed!
");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}(4)插入节点//把pnew指向的节点插入到头节点的前面,也就是整个链表的末尾bo
- 2022-02-14 07:06:11下载
- 积分:1
-
自己写的课程设计数据结构,有需要的就看自己的了…
自己写的,数据结构课程设计,有需要的可以来看看看的,郁闷上传这麻烦-Their written curriculum design data structure, there is a need to look at to see if the can, and depressed From this trouble
- 2022-08-23 09:45:53下载
- 积分:1
-
VB精典SQL数据库开发源代码
VB精典SQL数据库开发源代码-VB classic SQL database open source
- 2022-05-09 06:42:36下载
- 积分:1
-
Establishment and tree traversal can be achieved: (1) tree created using the fir...
二叉树的建立与遍历
可实现:
(1)树的创建采用先序方式,用特殊符号0表示左、右子树为空
(2)每次输入一个节点的值,可以根据自己的需要设计不同的节点结构
(3)节点的值为非零数
(4)可以()形式输出创建的树
(5)用先序后序和中序遍历树
(6)销毁树
-Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees
- 2022-05-14 12:51:14下载
- 积分:1
-
关于数据库的源代码。适合初学者参考如何使用数据库。
关于数据库的源代码。适合初学者参考如何使用数据库。-With regard to the database source code. Suitable for advanced users how to use the database.
- 2023-03-08 14:20:03下载
- 积分:1