Black_Spider_1.7.2

可以查看指定文件的字符，可以完成自行查找，并显示，功能强大(Can view the characters in the specified file, you can complete on their own to find, and display powerful)

一个计算器。比电脑上的厉害多了 。就像真实的计算器一样 (A calculator. Powerful than the computer a lot. Just like a real calculator)

附近是电缆的简易模型，利用PSCAD进行仿真，利用frequency model(PSCAD Cable frequency model)

语言之间跨平台的接口调用，非常有用，规避单语言功能(Cross platform interface calls between languages are very useful to avoid single language functions)

说明：  成绩排序(c++)用c++编的程序，你可以用它来为你的班级成绩排序(Sort results (c++) With c++ Allocation procedures, you can use it to your class to sort results)

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

魔力宝贝 私服辅助 偶尔小工具 自动战斗 高速战斗 脚本(moli sf software atuo fight)

非线性优化中的经典算法，LM算法，老外写的，言简意赅，对写优化程序很有用(nonlinear optimization of the classical algorithm, LM algorithm, a foreigner writing is concise and clear and optimization process of writing useful)

Michael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向 下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道在一 个区域中最长的滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。 (Michael likes to ski hundred This is not surprising, because the skiing is very stimulating indeed. However, in order to obtain speed, Waterloo regional must be downward-sloping, and when you slide into the base, you have to embark once again on the slope or to set you waiting for lifts. Michael would like to know the longest in a landslide area. Region is given by a two-dimensional array. Each figure represents an array of high points.)

说明：  lammps使用手册-中文简版（Michael博客）(Lammps user manual of Chinese Version from Michael blog.)