C语言实现的二维几何运算源码

这是一个随机点名程序，使用java语言开发，利用eclipse平台编写，运行该程序可以看到界面中有开始新点名或者继续上次点名，可以实现不重复点名，点名之后已点过的人会保存起来。

计算理论的经典算法，将确定型有穷自动机最简化，根据等价类的算法用vc实现化简过程。-classical theory calculation algorithm, will determine type DFA most simplified, according to the algorithm equivalence classes with vc achieve simplification process.

一个比较简单的计算器,基本完成了实数的加减乘除的功能,还有取负号,开方,倒数,清除等功能.-A relatively simple calculator, the basic completion of the real functions of addition and subtraction, multiplication and division, as well as from a negative number, prescription, countdown, removing and other functions.

程序：全主元Gauss消去法 过程：gaussq(aa,bb,xx,n,sgn) 作用：aa为系数矩阵，bb为右端向量，xx为解向量，n为方程阶数，sgn为标识符，1表示计算正常进行，0表示计算失败 方程形式为：aa(n,n)*x(n)=bb(n)-Procedure: All the main element Gauss elimination process: gaussq (aa, bb, xx, n, sgn) Role: aa for the coefficient matrix, bb for the right-hand side vector, xx for the solution vector, n the order of the equation, sgn as identifiers, 1 indicates the calculation as normal, 0 indicates failure of the calculation equation of the form: aa (n, n)* x (n) = bb (n)

关于分支为3的树，它的节点种类总数小于7，深度为3，全探索的源代码-With regard to the three branches of the tree, which is less than the total number of nodes of type 7, a depth of 3, all to explore the source code

一个拼图游戏的源代码-a source puzzles

使用循环链表实现空间复杂度压缩的LZSS算法

可用于增加，删除，修改和浏览的行文本编辑器-can be used to add, delete, modify and access to the lines of text editors

AppWizard has created this TspSA application for you.  This application not only demonstrates the basics of using the Microsoft Foundation classes but is also a starting point for writing your application. This file contains a summary of what you will find in each of the files that make up your TspSA application. TspSA.dsp     This file (the project file) contains information at the project level and     is used to build a single project or subproject. Other users can share the     project (.dsp) file, but they should export the makefiles locally. TspSA.h     This is the main header file for the application.  It includes other     project specific headers (including Resource.h) and declares the     CTspSAApp application class. TspSA.cpp     This

Solovay-strassen概率判别法  利用欧拉判别条件 成立不一定为素数，n为合数时成立叫做基b的euler拟素数 基b的euler拟素数一定是基b的拟素数，逆不成立 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报