jisuanqi

可用于抽奖等需要临时随机抽号的场合（压缩包中详细的说明文档）(Can be used to draw random numbers that require temporary occasions (compressed package detailed documentation))

模拟电话本，本程序是初学C++时候写得，作为初学者的参考(The analog phone book, this program is the beginner C++ when written, as a reference for beginners)

说明：  全球定位系统单点定位程序，根据N文件和O文件解算地面点的坐标(Global positioning system, single point positioning procedure, in accordance with N documents and O document solver coordinates of ground points)

运用伸展树的特性，每次插入新的结点后，调用展开函数，使得新结点成 为所建树的根结点。(Use of the characteristics of the splay tree, each time you insert a new node, call to function, making the new node into For the achievements of the root.)

bin 格式转 hex 格式小程序，大家可以自己编译一下.(bin format to hex format applet, we can compile their own look.)

C语言写的地铁模拟收费系统，实现了一些地铁收费的基本功能。(Metro analog toll system written in C language, some of the basic functions of the MTR charges.)

有2*n个盒子排成一行，其中有两个相邻的空盒，有n-1个盒子有符号 A ，有n-1个盒子有符号 B 。例如，n=5，并有初始配置如下： A B B A . . A B A B (2* n box row, wherein there are two adjacent empty box, n-1 of a box with the symbol ' A' , the symbol ' B' n-1 th box. For example, n = 5, and the initial configuration is as follows: ABBA .. ABAB)

简单的通讯录编程，基于c语言或C++，只有源码，喜欢的顶下(Simple address book program, based on c language or C++, only the source code, like the parietal)

使用ceres对曲线进行拟合程序，ceres可以从github下载；(Using ceres fitting program, Ceres can be downloaded github )

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)