搜索资源列表
stdio-common
- 绝对正真的stdio.h的实现，从原始的io角度看待自己所编写的c指令，对以后c的深入研究大有裨益。-absolute stdio.h is really the realization of the original from the perspective of their io prepared by the c direction right after c-depth study of great benefit.
gads
- #include <stdio.h> unsigned long int crc32_table[256] unsigned long int ulPolynomial = 0x04c11db7 unsigned long int Reflect(unsigned long int ref, char ch) { unsigned long int value(0) // 交换bit0和bit7，bit1和bit6，类推 for(int i = 1
huidu
- #include \"stdio.h\" #include \"malloc.h\" #define TRUE 1 #define n 39 #define max 500 typedef struct { char p[n] float w[n][n] }graph graph *ga2 int visit[n] int path[n][n] float C[n][n] float A[n][n] -#includ
332658
- #include <stdio.h> #include <string.h> #include <stdlib.h> #include <malloc.h> #include <math.h> #include <conio.h> struct DuLNode{ struct DuLNode *prior int data struct DuLNode *next-# in
tu
- [输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达
4
- 学会对文件的记录锁定，及解锁。#include <stdio.h> #include <unistd.h> #include <fcntl.h> int main() { int fd int i struct { char name[20] uint ID int age } myrec fd =open(\"name\", O_RDWR|O_CREAT, 0755)
BGI-putin
- 第三方BGI使用测试例程，#include "graphics.h" #include "Svga256.h" #include "stdio.h" #include "fcntl.h" #include "malloc.h" #include "io.h"-the third BGI testing examples，#include "graphics.h" #include "Svga256.h" #include "stdio.h" #include "f
cnclrve-malloc
- #include stdio,h #include malloc,h #define TRUE 1 #define n,(# include the stdio, h # include malloc, 1 # define n h # define TRUE,)