lianjie

这些代码用于循环移位操作，方便快捷，使用C++编写，简单易懂。(These codes are used for circular shift operation, which is convenient and quick, and is easy to understand by using C++.)

Factory 模式的两个最重要的功能： 1）定义创建对象的接口，封装了对象的建； 2）使得具体化类的工作延迟到了子类中。 (Factory mode two most important functions: 1) the definition of an object to create an interface that encapsulates the construction objects 2) makes specific class work delayed to subclasses.)

what the test is it test to be tes

高速采集 高速战斗 拦截封包 自动战斗 自制封包等等((High speed acquisition, high speed combat, intercept packets, automatic combat, homemade packets and so on))

一个24点游戏的论文，可以作为格式来用，也可以用来自己做游戏(The papers of a 24-point game, as the format to use, can also be used to make their own game)

道路坐标计算，道路坐标匝道放样、线元法计算坐标(Road coordinate calculation)

说明：  两个字符串连接,利用指针函数(two strings, using indicator function )

This is a source code for FIR

一个兼具有excel一样的多文档功能，同时具有word的文档编辑和格式编辑功能(One and the same with excel multiple document features, but also has word document editing and formatting editing functions)

编写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.)